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


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


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

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 30591791300521640fbd37a0a7b1d6b8314227143a2e8306b493af7e281cc2b1
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 02:01:39,122 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 02:01:39,176 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-03-08 02:01:39,180 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 02:01:39,180 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 02:01:39,197 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 02:01:39,198 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 02:01:39,198 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 02:01:39,198 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 02:01:39,198 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 02:01:39,199 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 02:01:39,199 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 02:01:39,199 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 02:01:39,199 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 02:01:39,199 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 02:01:39,199 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 02:01:39,199 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 02:01:39,199 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-03-08 02:01:39,200 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 02:01:39,200 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-03-08 02:01:39,200 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 02:01:39,200 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 02:01:39,200 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 02:01:39,200 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 02:01:39,200 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-03-08 02:01:39,200 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 02:01:39,200 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 02:01:39,200 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 02:01:39,200 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 02:01:39,200 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 02:01:39,200 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 02:01:39,200 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 02:01:39,200 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 02:01:39,201 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 02:01:39,201 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 02:01:39,201 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 02:01:39,201 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 02:01:39,201 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 02:01:39,201 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 02:01:39,201 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 02:01:39,201 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 02:01:39,201 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 02:01:39,201 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 02:01:39,201 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 -> 30591791300521640fbd37a0a7b1d6b8314227143a2e8306b493af7e281cc2b1
[2025-03-08 02:01:39,464 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 02:01:39,472 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 02:01:39,474 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 02:01:39,475 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 02:01:39,475 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 02:01:39,476 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label38.c
[2025-03-08 02:01:40,732 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e4e7c27c/95b8f56d1dd549ea8c944f91390d0264/FLAG9456dd743
[2025-03-08 02:01:41,077 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 02:01:41,079 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label38.c
[2025-03-08 02:01:41,100 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e4e7c27c/95b8f56d1dd549ea8c944f91390d0264/FLAG9456dd743
[2025-03-08 02:01:41,112 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e4e7c27c/95b8f56d1dd549ea8c944f91390d0264
[2025-03-08 02:01:41,114 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 02:01:41,116 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 02:01:41,118 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 02:01:41,118 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 02:01:41,121 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 02:01:41,122 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:01:41" (1/1) ...
[2025-03-08 02:01:41,124 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f92fc21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:41, skipping insertion in model container
[2025-03-08 02:01:41,124 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:01:41" (1/1) ...
[2025-03-08 02:01:41,173 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 02:01:41,321 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/Problem15_label38.c[3800,3813]
[2025-03-08 02:01:41,576 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 02:01:41,584 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 02:01:41,602 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/Problem15_label38.c[3800,3813]
[2025-03-08 02:01:41,737 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 02:01:41,752 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 02:01:41,753 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:41 WrapperNode
[2025-03-08 02:01:41,753 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 02:01:41,754 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 02:01:41,754 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 02:01:41,755 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 02:01:41,761 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:41" (1/1) ...
[2025-03-08 02:01:41,794 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:41" (1/1) ...
[2025-03-08 02:01:41,916 INFO  L138                Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757
[2025-03-08 02:01:41,918 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 02:01:41,918 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 02:01:41,918 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 02:01:41,918 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 02:01:41,925 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:41" (1/1) ...
[2025-03-08 02:01:41,925 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:41" (1/1) ...
[2025-03-08 02:01:41,951 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:41" (1/1) ...
[2025-03-08 02:01:42,054 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-03-08 02:01:42,054 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:41" (1/1) ...
[2025-03-08 02:01:42,055 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:41" (1/1) ...
[2025-03-08 02:01:42,126 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:41" (1/1) ...
[2025-03-08 02:01:42,134 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:41" (1/1) ...
[2025-03-08 02:01:42,142 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:41" (1/1) ...
[2025-03-08 02:01:42,151 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:41" (1/1) ...
[2025-03-08 02:01:42,171 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 02:01:42,173 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 02:01:42,173 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 02:01:42,173 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 02:01:42,174 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:41" (1/1) ...
[2025-03-08 02:01:42,178 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 02:01:42,186 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 02:01:42,216 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 02:01:42,219 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 02:01:42,239 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 02:01:42,240 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 02:01:42,240 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 02:01:42,240 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 02:01:42,291 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 02:01:42,293 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 02:01:44,179 INFO  L1307  $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1;
[2025-03-08 02:01:44,241 INFO  L?                        ?]: Removed 246 outVars from TransFormulas that were not future-live.
[2025-03-08 02:01:44,241 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 02:01:44,261 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 02:01:44,261 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 02:01:44,261 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:01:44 BoogieIcfgContainer
[2025-03-08 02:01:44,261 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 02:01:44,268 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 02:01:44,269 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 02:01:44,272 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 02:01:44,272 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:01:41" (1/3) ...
[2025-03-08 02:01:44,272 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33dd42f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:01:44, skipping insertion in model container
[2025-03-08 02:01:44,272 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:01:41" (2/3) ...
[2025-03-08 02:01:44,273 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33dd42f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:01:44, skipping insertion in model container
[2025-03-08 02:01:44,273 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:01:44" (3/3) ...
[2025-03-08 02:01:44,274 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem15_label38.c
[2025-03-08 02:01:44,285 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 02:01:44,286 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label38.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 02:01:44,356 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 02:01:44,369 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;@3462cabc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 02:01:44,369 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 02:01:44,374 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:44,381 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2025-03-08 02:01:44,382 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:44,383 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]
[2025-03-08 02:01:44,383 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:44,389 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:44,390 INFO  L85        PathProgramCache]: Analyzing trace with hash 1014222298, now seen corresponding path program 1 times
[2025-03-08 02:01:44,397 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:44,397 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120445580]
[2025-03-08 02:01:44,397 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:44,400 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:44,462 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes.
[2025-03-08 02:01:44,489 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements.
[2025-03-08 02:01:44,489 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:44,490 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:44,653 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 02:01:44,656 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:44,657 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120445580]
[2025-03-08 02:01:44,657 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120445580] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:01:44,657 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:01:44,657 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 02:01:44,658 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152371994]
[2025-03-08 02:01:44,659 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:44,663 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:01:44,664 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:44,677 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:01:44,678 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:44,681 INFO  L87              Difference]: Start difference. First operand  has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 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 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:46,287 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:01:46,288 INFO  L93              Difference]: Finished difference Result 1155 states and 2103 transitions.
[2025-03-08 02:01:46,289 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:01:46,290 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30
[2025-03-08 02:01:46,290 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:01:46,303 INFO  L225             Difference]: With dead ends: 1155
[2025-03-08 02:01:46,303 INFO  L226             Difference]: Without dead ends: 667
[2025-03-08 02:01:46,306 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:46,311 INFO  L435           NwaCegarLoop]: 328 mSDtfsCounter, 314 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-03-08 02:01:46,311 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 370 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-03-08 02:01:46,326 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 667 states.
[2025-03-08 02:01:46,353 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 665.
[2025-03-08 02:01:46,357 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 665 states, 664 states have (on average 1.4789156626506024) internal successors, (982), 664 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:46,361 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 982 transitions.
[2025-03-08 02:01:46,363 INFO  L78                 Accepts]: Start accepts. Automaton has 665 states and 982 transitions. Word has length 30
[2025-03-08 02:01:46,363 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:01:46,363 INFO  L471      AbstractCegarLoop]: Abstraction has 665 states and 982 transitions.
[2025-03-08 02:01:46,364 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:46,364 INFO  L276                IsEmpty]: Start isEmpty. Operand 665 states and 982 transitions.
[2025-03-08 02:01:46,365 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2025-03-08 02:01:46,366 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:46,366 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]
[2025-03-08 02:01:46,366 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-08 02:01:46,366 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:46,369 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:46,369 INFO  L85        PathProgramCache]: Analyzing trace with hash -1204405982, now seen corresponding path program 1 times
[2025-03-08 02:01:46,369 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:46,369 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232936094]
[2025-03-08 02:01:46,369 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:46,369 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:46,414 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-03-08 02:01:46,447 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-03-08 02:01:46,447 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:46,447 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:46,568 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-08 02:01:46,568 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:46,569 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232936094]
[2025-03-08 02:01:46,569 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232936094] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:01:46,569 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:01:46,569 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 02:01:46,569 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455552834]
[2025-03-08 02:01:46,569 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:46,570 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:01:46,570 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:46,570 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:01:46,570 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:46,570 INFO  L87              Difference]: Start difference. First operand 665 states and 982 transitions. Second operand  has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:47,841 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:01:47,841 INFO  L93              Difference]: Finished difference Result 1953 states and 2893 transitions.
[2025-03-08 02:01:47,842 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:01:47,842 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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 105
[2025-03-08 02:01:47,842 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:01:47,847 INFO  L225             Difference]: With dead ends: 1953
[2025-03-08 02:01:47,848 INFO  L226             Difference]: Without dead ends: 1290
[2025-03-08 02:01:47,851 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:47,852 INFO  L435           NwaCegarLoop]: 286 mSDtfsCounter, 256 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-08 02:01:47,853 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 324 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-08 02:01:47,854 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1290 states.
[2025-03-08 02:01:47,879 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1282.
[2025-03-08 02:01:47,881 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1282 states, 1281 states have (on average 1.3981264637002342) internal successors, (1791), 1281 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:47,888 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1791 transitions.
[2025-03-08 02:01:47,888 INFO  L78                 Accepts]: Start accepts. Automaton has 1282 states and 1791 transitions. Word has length 105
[2025-03-08 02:01:47,889 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:01:47,889 INFO  L471      AbstractCegarLoop]: Abstraction has 1282 states and 1791 transitions.
[2025-03-08 02:01:47,889 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:47,889 INFO  L276                IsEmpty]: Start isEmpty. Operand 1282 states and 1791 transitions.
[2025-03-08 02:01:47,892 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2025-03-08 02:01:47,893 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:47,893 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]
[2025-03-08 02:01:47,894 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 02:01:47,894 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:47,894 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:47,894 INFO  L85        PathProgramCache]: Analyzing trace with hash -1971051880, now seen corresponding path program 1 times
[2025-03-08 02:01:47,894 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:47,894 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771228235]
[2025-03-08 02:01:47,895 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:47,895 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:47,912 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes.
[2025-03-08 02:01:47,933 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements.
[2025-03-08 02:01:47,933 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:47,933 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:48,061 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-08 02:01:48,061 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:48,061 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771228235]
[2025-03-08 02:01:48,062 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771228235] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:01:48,062 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:01:48,062 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 02:01:48,062 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267878148]
[2025-03-08 02:01:48,062 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:48,062 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:01:48,062 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:48,062 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:01:48,063 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:48,063 INFO  L87              Difference]: Start difference. First operand 1282 states and 1791 transitions. Second operand  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:49,161 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:01:49,161 INFO  L93              Difference]: Finished difference Result 3766 states and 5261 transitions.
[2025-03-08 02:01:49,162 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:01:49,163 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 109
[2025-03-08 02:01:49,163 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:01:49,170 INFO  L225             Difference]: With dead ends: 3766
[2025-03-08 02:01:49,171 INFO  L226             Difference]: Without dead ends: 2486
[2025-03-08 02:01:49,174 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:49,175 INFO  L435           NwaCegarLoop]: 271 mSDtfsCounter, 271 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-08 02:01:49,177 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 338 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-08 02:01:49,179 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2486 states.
[2025-03-08 02:01:49,202 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2182.
[2025-03-08 02:01:49,205 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2182 states, 2181 states have (on average 1.2815222375057314) internal successors, (2795), 2181 states have internal predecessors, (2795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:49,209 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 2795 transitions.
[2025-03-08 02:01:49,209 INFO  L78                 Accepts]: Start accepts. Automaton has 2182 states and 2795 transitions. Word has length 109
[2025-03-08 02:01:49,209 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:01:49,209 INFO  L471      AbstractCegarLoop]: Abstraction has 2182 states and 2795 transitions.
[2025-03-08 02:01:49,210 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:49,210 INFO  L276                IsEmpty]: Start isEmpty. Operand 2182 states and 2795 transitions.
[2025-03-08 02:01:49,211 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 227
[2025-03-08 02:01:49,211 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:49,211 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:01:49,212 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 02:01:49,212 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:49,212 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:49,212 INFO  L85        PathProgramCache]: Analyzing trace with hash -491834481, now seen corresponding path program 1 times
[2025-03-08 02:01:49,212 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:49,212 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047150310]
[2025-03-08 02:01:49,212 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:49,213 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:49,240 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes.
[2025-03-08 02:01:49,263 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements.
[2025-03-08 02:01:49,263 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:49,263 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:49,450 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-08 02:01:49,451 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:49,451 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047150310]
[2025-03-08 02:01:49,451 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047150310] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:01:49,451 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:01:49,451 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:01:49,452 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295000544]
[2025-03-08 02:01:49,452 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:49,452 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:01:49,452 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:49,453 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:01:49,453 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:49,453 INFO  L87              Difference]: Start difference. First operand 2182 states and 2795 transitions. Second operand  has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:50,599 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:01:50,600 INFO  L93              Difference]: Finished difference Result 5567 states and 7266 transitions.
[2025-03-08 02:01:50,600 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:01:50,600 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 226
[2025-03-08 02:01:50,601 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:01:50,612 INFO  L225             Difference]: With dead ends: 5567
[2025-03-08 02:01:50,613 INFO  L226             Difference]: Without dead ends: 3387
[2025-03-08 02:01:50,616 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:50,617 INFO  L435           NwaCegarLoop]: 575 mSDtfsCounter, 298 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-08 02:01:50,617 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 614 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-08 02:01:50,620 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3387 states.
[2025-03-08 02:01:50,660 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3387 to 3385.
[2025-03-08 02:01:50,664 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3385 states, 3384 states have (on average 1.216016548463357) internal successors, (4115), 3384 states have internal predecessors, (4115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:50,672 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4115 transitions.
[2025-03-08 02:01:50,672 INFO  L78                 Accepts]: Start accepts. Automaton has 3385 states and 4115 transitions. Word has length 226
[2025-03-08 02:01:50,673 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:01:50,673 INFO  L471      AbstractCegarLoop]: Abstraction has 3385 states and 4115 transitions.
[2025-03-08 02:01:50,673 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:50,673 INFO  L276                IsEmpty]: Start isEmpty. Operand 3385 states and 4115 transitions.
[2025-03-08 02:01:50,676 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 313
[2025-03-08 02:01:50,676 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:50,676 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:01:50,676 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 02:01:50,677 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:50,677 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:50,677 INFO  L85        PathProgramCache]: Analyzing trace with hash 787206625, now seen corresponding path program 1 times
[2025-03-08 02:01:50,677 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:50,678 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648924697]
[2025-03-08 02:01:50,678 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:50,678 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:50,745 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes.
[2025-03-08 02:01:50,771 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements.
[2025-03-08 02:01:50,772 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:50,772 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:51,007 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-08 02:01:51,008 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:51,008 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648924697]
[2025-03-08 02:01:51,008 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648924697] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:01:51,008 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:01:51,008 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:01:51,008 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745894771]
[2025-03-08 02:01:51,008 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:51,009 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:01:51,009 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:51,009 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:01:51,010 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:51,010 INFO  L87              Difference]: Start difference. First operand 3385 states and 4115 transitions. Second operand  has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:52,180 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:01:52,180 INFO  L93              Difference]: Finished difference Result 7972 states and 9907 transitions.
[2025-03-08 02:01:52,181 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:01:52,181 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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 312
[2025-03-08 02:01:52,181 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:01:52,195 INFO  L225             Difference]: With dead ends: 7972
[2025-03-08 02:01:52,195 INFO  L226             Difference]: Without dead ends: 4589
[2025-03-08 02:01:52,199 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:52,201 INFO  L435           NwaCegarLoop]: 593 mSDtfsCounter, 299 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-08 02:01:52,201 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 631 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-08 02:01:52,206 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4589 states.
[2025-03-08 02:01:52,251 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4589 to 4285.
[2025-03-08 02:01:52,255 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4285 states, 4284 states have (on average 1.1993464052287581) internal successors, (5138), 4284 states have internal predecessors, (5138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:52,262 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4285 states to 4285 states and 5138 transitions.
[2025-03-08 02:01:52,263 INFO  L78                 Accepts]: Start accepts. Automaton has 4285 states and 5138 transitions. Word has length 312
[2025-03-08 02:01:52,263 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:01:52,263 INFO  L471      AbstractCegarLoop]: Abstraction has 4285 states and 5138 transitions.
[2025-03-08 02:01:52,263 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:52,264 INFO  L276                IsEmpty]: Start isEmpty. Operand 4285 states and 5138 transitions.
[2025-03-08 02:01:52,268 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 391
[2025-03-08 02:01:52,268 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:52,268 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:01:52,269 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 02:01:52,269 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:52,269 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:52,269 INFO  L85        PathProgramCache]: Analyzing trace with hash -1146433637, now seen corresponding path program 1 times
[2025-03-08 02:01:52,270 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:52,270 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888065309]
[2025-03-08 02:01:52,270 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:52,271 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:52,321 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes.
[2025-03-08 02:01:52,352 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements.
[2025-03-08 02:01:52,352 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:52,352 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:52,912 INFO  L134       CoverageAnalysis]: Checked inductivity of 218 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2025-03-08 02:01:52,912 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:52,912 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888065309]
[2025-03-08 02:01:52,912 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888065309] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:01:52,912 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:01:52,913 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-03-08 02:01:52,913 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987101307]
[2025-03-08 02:01:52,914 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:52,914 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:01:52,914 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:52,914 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:01:52,915 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:52,915 INFO  L87              Difference]: Start difference. First operand 4285 states and 5138 transitions. Second operand  has 3 states, 3 states have (on average 121.0) internal successors, (363), 2 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:53,832 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:01:53,832 INFO  L93              Difference]: Finished difference Result 8867 states and 10585 transitions.
[2025-03-08 02:01:53,833 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:01:53,833 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 121.0) internal successors, (363), 2 states have internal predecessors, (363), 0 states have call successors, (0), 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 390
[2025-03-08 02:01:53,833 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:01:53,844 INFO  L225             Difference]: With dead ends: 8867
[2025-03-08 02:01:53,844 INFO  L226             Difference]: Without dead ends: 4584
[2025-03-08 02:01:53,848 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:53,848 INFO  L435           NwaCegarLoop]: 319 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-08 02:01:53,848 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 354 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-08 02:01:53,851 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4584 states.
[2025-03-08 02:01:53,918 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4584 to 4584.
[2025-03-08 02:01:53,923 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4584 states, 4583 states have (on average 1.1876500109098844) internal successors, (5443), 4583 states have internal predecessors, (5443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:53,930 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4584 states to 4584 states and 5443 transitions.
[2025-03-08 02:01:53,931 INFO  L78                 Accepts]: Start accepts. Automaton has 4584 states and 5443 transitions. Word has length 390
[2025-03-08 02:01:53,931 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:01:53,931 INFO  L471      AbstractCegarLoop]: Abstraction has 4584 states and 5443 transitions.
[2025-03-08 02:01:53,931 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 121.0) internal successors, (363), 2 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:53,931 INFO  L276                IsEmpty]: Start isEmpty. Operand 4584 states and 5443 transitions.
[2025-03-08 02:01:53,936 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 482
[2025-03-08 02:01:53,936 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:53,937 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:01:53,937 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 02:01:53,937 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:53,937 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:53,938 INFO  L85        PathProgramCache]: Analyzing trace with hash -1384480874, now seen corresponding path program 1 times
[2025-03-08 02:01:53,938 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:53,938 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176920978]
[2025-03-08 02:01:53,938 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:53,938 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:53,972 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes.
[2025-03-08 02:01:54,006 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements.
[2025-03-08 02:01:54,007 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:54,007 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:54,257 INFO  L134       CoverageAnalysis]: Checked inductivity of 427 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked.
[2025-03-08 02:01:54,257 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:54,257 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176920978]
[2025-03-08 02:01:54,257 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176920978] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:01:54,257 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:01:54,258 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:01:54,258 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520315739]
[2025-03-08 02:01:54,258 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:54,258 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:01:54,258 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:54,258 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:01:54,258 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:54,259 INFO  L87              Difference]: Start difference. First operand 4584 states and 5443 transitions. Second operand  has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:55,421 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:01:55,421 INFO  L93              Difference]: Finished difference Result 11558 states and 13806 transitions.
[2025-03-08 02:01:55,423 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:01:55,423 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 481
[2025-03-08 02:01:55,424 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:01:55,438 INFO  L225             Difference]: With dead ends: 11558
[2025-03-08 02:01:55,438 INFO  L226             Difference]: Without dead ends: 7275
[2025-03-08 02:01:55,441 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:55,442 INFO  L435           NwaCegarLoop]: 274 mSDtfsCounter, 148 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-08 02:01:55,442 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 316 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-08 02:01:55,447 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7275 states.
[2025-03-08 02:01:55,494 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7275 to 6079.
[2025-03-08 02:01:55,502 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6079 states, 6078 states have (on average 1.1661730832510695) internal successors, (7088), 6078 states have internal predecessors, (7088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:55,512 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6079 states to 6079 states and 7088 transitions.
[2025-03-08 02:01:55,512 INFO  L78                 Accepts]: Start accepts. Automaton has 6079 states and 7088 transitions. Word has length 481
[2025-03-08 02:01:55,512 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:01:55,513 INFO  L471      AbstractCegarLoop]: Abstraction has 6079 states and 7088 transitions.
[2025-03-08 02:01:55,513 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:55,513 INFO  L276                IsEmpty]: Start isEmpty. Operand 6079 states and 7088 transitions.
[2025-03-08 02:01:55,519 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 515
[2025-03-08 02:01:55,519 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:55,520 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:01:55,520 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 02:01:55,521 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:55,521 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:55,521 INFO  L85        PathProgramCache]: Analyzing trace with hash -386674838, now seen corresponding path program 1 times
[2025-03-08 02:01:55,521 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:55,521 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844681382]
[2025-03-08 02:01:55,521 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:55,522 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:55,567 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes.
[2025-03-08 02:01:55,598 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements.
[2025-03-08 02:01:55,598 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:55,598 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:56,097 INFO  L134       CoverageAnalysis]: Checked inductivity of 635 backedges. 465 proven. 39 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked.
[2025-03-08 02:01:56,097 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:56,097 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844681382]
[2025-03-08 02:01:56,097 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844681382] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 02:01:56,097 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013516889]
[2025-03-08 02:01:56,098 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:56,098 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 02:01:56,098 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 02:01:56,100 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 02:01:56,102 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-08 02:01:56,165 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes.
[2025-03-08 02:01:56,254 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements.
[2025-03-08 02:01:56,255 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:56,255 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:56,259 INFO  L256         TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-08 02:01:56,269 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 02:01:56,343 INFO  L134       CoverageAnalysis]: Checked inductivity of 635 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked.
[2025-03-08 02:01:56,343 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 02:01:56,343 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013516889] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:01:56,343 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 02:01:56,343 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-08 02:01:56,343 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664220332]
[2025-03-08 02:01:56,344 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:56,344 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:01:56,344 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:56,344 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:01:56,344 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 02:01:56,345 INFO  L87              Difference]: Start difference. First operand 6079 states and 7088 transitions. Second operand  has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:57,458 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:01:57,458 INFO  L93              Difference]: Finished difference Result 15145 states and 17759 transitions.
[2025-03-08 02:01:57,459 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:01:57,459 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 514
[2025-03-08 02:01:57,460 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:01:57,477 INFO  L225             Difference]: With dead ends: 15145
[2025-03-08 02:01:57,477 INFO  L226             Difference]: Without dead ends: 9367
[2025-03-08 02:01:57,483 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 513 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 02:01:57,483 INFO  L435           NwaCegarLoop]: 227 mSDtfsCounter, 310 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-08 02:01:57,483 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 263 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-08 02:01:57,489 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9367 states.
[2025-03-08 02:01:57,558 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9367 to 7572.
[2025-03-08 02:01:57,568 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7572 states, 7571 states have (on average 1.1629903579447893) internal successors, (8805), 7571 states have internal predecessors, (8805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:57,579 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7572 states to 7572 states and 8805 transitions.
[2025-03-08 02:01:57,580 INFO  L78                 Accepts]: Start accepts. Automaton has 7572 states and 8805 transitions. Word has length 514
[2025-03-08 02:01:57,581 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:01:57,581 INFO  L471      AbstractCegarLoop]: Abstraction has 7572 states and 8805 transitions.
[2025-03-08 02:01:57,581 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:57,581 INFO  L276                IsEmpty]: Start isEmpty. Operand 7572 states and 8805 transitions.
[2025-03-08 02:01:57,587 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 519
[2025-03-08 02:01:57,587 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:57,587 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:01:57,596 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-08 02:01:57,787 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 02:01:57,788 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:57,788 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:57,788 INFO  L85        PathProgramCache]: Analyzing trace with hash 1518163168, now seen corresponding path program 1 times
[2025-03-08 02:01:57,788 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:57,788 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743693241]
[2025-03-08 02:01:57,788 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:57,788 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:57,845 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes.
[2025-03-08 02:01:57,877 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements.
[2025-03-08 02:01:57,877 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:57,877 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:58,143 INFO  L134       CoverageAnalysis]: Checked inductivity of 647 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked.
[2025-03-08 02:01:58,143 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:58,143 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743693241]
[2025-03-08 02:01:58,143 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743693241] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:01:58,143 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:01:58,144 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:01:58,144 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381604364]
[2025-03-08 02:01:58,144 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:58,144 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:01:58,144 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:58,145 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:01:58,145 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:58,145 INFO  L87              Difference]: Start difference. First operand 7572 states and 8805 transitions. Second operand  has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:59,338 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:01:59,338 INFO  L93              Difference]: Finished difference Result 18445 states and 21669 transitions.
[2025-03-08 02:01:59,338 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:01:59,339 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 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 518
[2025-03-08 02:01:59,339 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:01:59,354 INFO  L225             Difference]: With dead ends: 18445
[2025-03-08 02:01:59,354 INFO  L226             Difference]: Without dead ends: 11174
[2025-03-08 02:01:59,359 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:59,360 INFO  L435           NwaCegarLoop]: 588 mSDtfsCounter, 247 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-08 02:01:59,360 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 620 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-08 02:01:59,366 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11174 states.
[2025-03-08 02:01:59,442 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11174 to 11163.
[2025-03-08 02:01:59,450 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11163 states, 11162 states have (on average 1.1478229707937646) internal successors, (12812), 11162 states have internal predecessors, (12812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:59,464 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11163 states to 11163 states and 12812 transitions.
[2025-03-08 02:01:59,465 INFO  L78                 Accepts]: Start accepts. Automaton has 11163 states and 12812 transitions. Word has length 518
[2025-03-08 02:01:59,466 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:01:59,466 INFO  L471      AbstractCegarLoop]: Abstraction has 11163 states and 12812 transitions.
[2025-03-08 02:01:59,466 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:01:59,466 INFO  L276                IsEmpty]: Start isEmpty. Operand 11163 states and 12812 transitions.
[2025-03-08 02:01:59,473 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 532
[2025-03-08 02:01:59,473 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:01:59,473 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:01:59,473 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 02:01:59,474 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:01:59,474 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:01:59,474 INFO  L85        PathProgramCache]: Analyzing trace with hash 1723723753, now seen corresponding path program 1 times
[2025-03-08 02:01:59,474 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:01:59,474 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076726736]
[2025-03-08 02:01:59,474 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:01:59,475 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:01:59,528 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes.
[2025-03-08 02:01:59,561 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements.
[2025-03-08 02:01:59,561 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:01:59,561 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:01:59,731 INFO  L134       CoverageAnalysis]: Checked inductivity of 417 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked.
[2025-03-08 02:01:59,731 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:01:59,731 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076726736]
[2025-03-08 02:01:59,731 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076726736] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:01:59,731 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:01:59,731 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:01:59,731 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153896153]
[2025-03-08 02:01:59,731 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:01:59,731 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:01:59,731 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:01:59,732 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:01:59,732 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:01:59,732 INFO  L87              Difference]: Start difference. First operand 11163 states and 12812 transitions. Second operand  has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:01,021 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:02:01,021 INFO  L93              Difference]: Finished difference Result 22322 states and 25656 transitions.
[2025-03-08 02:02:01,021 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:02:01,021 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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 531
[2025-03-08 02:02:01,022 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:02:01,034 INFO  L225             Difference]: With dead ends: 22322
[2025-03-08 02:02:01,034 INFO  L226             Difference]: Without dead ends: 11460
[2025-03-08 02:02:01,040 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:02:01,040 INFO  L435           NwaCegarLoop]: 65 mSDtfsCounter, 464 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-03-08 02:02:01,041 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 70 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-03-08 02:02:01,046 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11460 states.
[2025-03-08 02:02:01,102 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11460 to 11161.
[2025-03-08 02:02:01,111 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11161 states, 11160 states have (on average 1.1476702508960575) internal successors, (12808), 11160 states have internal predecessors, (12808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:01,120 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11161 states to 11161 states and 12808 transitions.
[2025-03-08 02:02:01,120 INFO  L78                 Accepts]: Start accepts. Automaton has 11161 states and 12808 transitions. Word has length 531
[2025-03-08 02:02:01,121 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:02:01,121 INFO  L471      AbstractCegarLoop]: Abstraction has 11161 states and 12808 transitions.
[2025-03-08 02:02:01,121 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:01,121 INFO  L276                IsEmpty]: Start isEmpty. Operand 11161 states and 12808 transitions.
[2025-03-08 02:02:01,125 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 552
[2025-03-08 02:02:01,125 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:02:01,126 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:02:01,126 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-08 02:02:01,126 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:02:01,126 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:02:01,127 INFO  L85        PathProgramCache]: Analyzing trace with hash 826562971, now seen corresponding path program 1 times
[2025-03-08 02:02:01,127 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:02:01,127 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956661773]
[2025-03-08 02:02:01,127 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:02:01,127 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:02:01,159 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 551 statements into 1 equivalence classes.
[2025-03-08 02:02:01,179 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 551 of 551 statements.
[2025-03-08 02:02:01,179 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:02:01,179 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:02:01,291 INFO  L134       CoverageAnalysis]: Checked inductivity of 568 backedges. 333 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked.
[2025-03-08 02:02:01,291 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:02:01,291 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956661773]
[2025-03-08 02:02:01,291 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956661773] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:02:01,291 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:02:01,291 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:02:01,291 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32784061]
[2025-03-08 02:02:01,291 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:02:01,292 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:02:01,292 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:02:01,292 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:02:01,292 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:02:01,293 INFO  L87              Difference]: Start difference. First operand 11161 states and 12808 transitions. Second operand  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:02,154 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:02:02,154 INFO  L93              Difference]: Finished difference Result 23815 states and 27331 transitions.
[2025-03-08 02:02:02,155 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:02:02,155 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 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 551
[2025-03-08 02:02:02,155 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:02:02,171 INFO  L225             Difference]: With dead ends: 23815
[2025-03-08 02:02:02,171 INFO  L226             Difference]: Without dead ends: 12955
[2025-03-08 02:02:02,180 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:02:02,181 INFO  L435           NwaCegarLoop]: 261 mSDtfsCounter, 270 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-08 02:02:02,182 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 322 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-08 02:02:02,190 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12955 states.
[2025-03-08 02:02:02,253 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12955 to 9364.
[2025-03-08 02:02:02,261 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9364 states, 9363 states have (on average 1.1611662928548543) internal successors, (10872), 9363 states have internal predecessors, (10872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:02,268 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9364 states to 9364 states and 10872 transitions.
[2025-03-08 02:02:02,269 INFO  L78                 Accepts]: Start accepts. Automaton has 9364 states and 10872 transitions. Word has length 551
[2025-03-08 02:02:02,269 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:02:02,269 INFO  L471      AbstractCegarLoop]: Abstraction has 9364 states and 10872 transitions.
[2025-03-08 02:02:02,270 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:02,270 INFO  L276                IsEmpty]: Start isEmpty. Operand 9364 states and 10872 transitions.
[2025-03-08 02:02:02,274 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 558
[2025-03-08 02:02:02,274 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:02:02,274 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:02:02,274 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-08 02:02:02,274 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:02:02,275 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:02:02,275 INFO  L85        PathProgramCache]: Analyzing trace with hash 1660514773, now seen corresponding path program 1 times
[2025-03-08 02:02:02,275 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:02:02,275 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055288375]
[2025-03-08 02:02:02,275 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:02:02,275 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:02:02,310 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes.
[2025-03-08 02:02:02,330 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements.
[2025-03-08 02:02:02,330 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:02:02,331 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:02:02,514 INFO  L134       CoverageAnalysis]: Checked inductivity of 445 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked.
[2025-03-08 02:02:02,515 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:02:02,515 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055288375]
[2025-03-08 02:02:02,515 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055288375] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:02:02,515 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:02:02,515 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:02:02,515 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004318416]
[2025-03-08 02:02:02,515 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:02:02,516 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:02:02,516 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:02:02,516 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:02:02,517 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:02:02,517 INFO  L87              Difference]: Start difference. First operand 9364 states and 10872 transitions. Second operand  has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:03,436 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:02:03,436 INFO  L93              Difference]: Finished difference Result 20821 states and 24627 transitions.
[2025-03-08 02:02:03,436 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:02:03,436 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 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 557
[2025-03-08 02:02:03,437 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:02:03,451 INFO  L225             Difference]: With dead ends: 20821
[2025-03-08 02:02:03,451 INFO  L226             Difference]: Without dead ends: 11758
[2025-03-08 02:02:03,459 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:02:03,461 INFO  L435           NwaCegarLoop]: 599 mSDtfsCounter, 289 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-08 02:02:03,461 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 634 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-08 02:02:03,467 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11758 states.
[2025-03-08 02:02:03,580 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11758 to 11459.
[2025-03-08 02:02:03,587 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11459 states, 11458 states have (on average 1.141647757025659) internal successors, (13081), 11458 states have internal predecessors, (13081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:03,597 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11459 states to 11459 states and 13081 transitions.
[2025-03-08 02:02:03,597 INFO  L78                 Accepts]: Start accepts. Automaton has 11459 states and 13081 transitions. Word has length 557
[2025-03-08 02:02:03,598 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:02:03,598 INFO  L471      AbstractCegarLoop]: Abstraction has 11459 states and 13081 transitions.
[2025-03-08 02:02:03,598 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:03,598 INFO  L276                IsEmpty]: Start isEmpty. Operand 11459 states and 13081 transitions.
[2025-03-08 02:02:03,605 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 573
[2025-03-08 02:02:03,605 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:02:03,606 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:02:03,606 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-08 02:02:03,606 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:02:03,607 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:02:03,607 INFO  L85        PathProgramCache]: Analyzing trace with hash 837094470, now seen corresponding path program 1 times
[2025-03-08 02:02:03,607 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:02:03,607 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149221915]
[2025-03-08 02:02:03,607 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:02:03,607 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:02:03,660 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 572 statements into 1 equivalence classes.
[2025-03-08 02:02:03,693 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 572 of 572 statements.
[2025-03-08 02:02:03,693 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:02:03,694 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:02:03,890 INFO  L134       CoverageAnalysis]: Checked inductivity of 619 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked.
[2025-03-08 02:02:03,890 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:02:03,890 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149221915]
[2025-03-08 02:02:03,890 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149221915] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:02:03,891 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:02:03,891 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:02:03,891 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823837640]
[2025-03-08 02:02:03,891 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:02:03,891 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:02:03,891 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:02:03,892 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:02:03,892 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:02:03,892 INFO  L87              Difference]: Start difference. First operand 11459 states and 13081 transitions. Second operand  has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:04,702 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:02:04,702 INFO  L93              Difference]: Finished difference Result 23813 states and 27124 transitions.
[2025-03-08 02:02:04,703 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:02:04,703 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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 572
[2025-03-08 02:02:04,703 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:02:04,713 INFO  L225             Difference]: With dead ends: 23813
[2025-03-08 02:02:04,713 INFO  L226             Difference]: Without dead ends: 11459
[2025-03-08 02:02:04,720 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:02:04,720 INFO  L435           NwaCegarLoop]: 618 mSDtfsCounter, 272 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-08 02:02:04,720 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 661 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-08 02:02:04,725 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11459 states.
[2025-03-08 02:02:04,785 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11459 to 11459.
[2025-03-08 02:02:04,795 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11459 states, 11458 states have (on average 1.1397277011694886) internal successors, (13059), 11458 states have internal predecessors, (13059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:04,805 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11459 states to 11459 states and 13059 transitions.
[2025-03-08 02:02:04,805 INFO  L78                 Accepts]: Start accepts. Automaton has 11459 states and 13059 transitions. Word has length 572
[2025-03-08 02:02:04,806 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:02:04,806 INFO  L471      AbstractCegarLoop]: Abstraction has 11459 states and 13059 transitions.
[2025-03-08 02:02:04,807 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:04,807 INFO  L276                IsEmpty]: Start isEmpty. Operand 11459 states and 13059 transitions.
[2025-03-08 02:02:04,812 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 594
[2025-03-08 02:02:04,812 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:02:04,812 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:02:04,812 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-08 02:02:04,812 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:02:04,813 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:02:04,813 INFO  L85        PathProgramCache]: Analyzing trace with hash 441667336, now seen corresponding path program 1 times
[2025-03-08 02:02:04,813 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:02:04,813 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732975671]
[2025-03-08 02:02:04,813 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:02:04,813 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:02:04,847 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes.
[2025-03-08 02:02:04,863 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements.
[2025-03-08 02:02:04,863 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:02:04,864 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:02:05,186 INFO  L134       CoverageAnalysis]: Checked inductivity of 974 backedges. 622 proven. 39 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked.
[2025-03-08 02:02:05,186 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:02:05,186 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732975671]
[2025-03-08 02:02:05,186 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732975671] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 02:02:05,186 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797585197]
[2025-03-08 02:02:05,187 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:02:05,187 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 02:02:05,188 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 02:02:05,189 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 02:02:05,191 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-03-08 02:02:05,248 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes.
[2025-03-08 02:02:05,322 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements.
[2025-03-08 02:02:05,322 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:02:05,322 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:02:05,325 INFO  L256         TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-03-08 02:02:05,330 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 02:02:05,441 INFO  L134       CoverageAnalysis]: Checked inductivity of 974 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked.
[2025-03-08 02:02:05,441 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 02:02:05,441 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797585197] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:02:05,442 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 02:02:05,442 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-03-08 02:02:05,442 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858883295]
[2025-03-08 02:02:05,442 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:02:05,442 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:02:05,442 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:02:05,443 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:02:05,443 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 02:02:05,443 INFO  L87              Difference]: Start difference. First operand 11459 states and 13059 transitions. Second operand  has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:06,498 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:02:06,498 INFO  L93              Difference]: Finished difference Result 22613 states and 25806 transitions.
[2025-03-08 02:02:06,499 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:02:06,499 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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 593
[2025-03-08 02:02:06,500 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:02:06,510 INFO  L225             Difference]: With dead ends: 22613
[2025-03-08 02:02:06,510 INFO  L226             Difference]: Without dead ends: 11455
[2025-03-08 02:02:06,518 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 592 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 02:02:06,518 INFO  L435           NwaCegarLoop]: 556 mSDtfsCounter, 251 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-08 02:02:06,518 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 592 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-08 02:02:06,525 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11455 states.
[2025-03-08 02:02:06,632 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11455 to 11155.
[2025-03-08 02:02:06,641 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11155 states, 11154 states have (on average 1.0888470503855119) internal successors, (12145), 11154 states have internal predecessors, (12145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:06,652 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11155 states to 11155 states and 12145 transitions.
[2025-03-08 02:02:06,652 INFO  L78                 Accepts]: Start accepts. Automaton has 11155 states and 12145 transitions. Word has length 593
[2025-03-08 02:02:06,653 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:02:06,653 INFO  L471      AbstractCegarLoop]: Abstraction has 11155 states and 12145 transitions.
[2025-03-08 02:02:06,653 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:06,653 INFO  L276                IsEmpty]: Start isEmpty. Operand 11155 states and 12145 transitions.
[2025-03-08 02:02:06,660 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 595
[2025-03-08 02:02:06,660 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:02:06,660 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:02:06,673 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-03-08 02:02:06,860 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,SelfDestructingSolverStorable13
[2025-03-08 02:02:06,861 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:02:06,861 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:02:06,862 INFO  L85        PathProgramCache]: Analyzing trace with hash 1798850520, now seen corresponding path program 1 times
[2025-03-08 02:02:06,862 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:02:06,862 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361955810]
[2025-03-08 02:02:06,862 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:02:06,862 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:02:06,896 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes.
[2025-03-08 02:02:06,916 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements.
[2025-03-08 02:02:06,917 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:02:06,917 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:02:07,328 INFO  L134       CoverageAnalysis]: Checked inductivity of 723 backedges. 549 proven. 39 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked.
[2025-03-08 02:02:07,329 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:02:07,329 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361955810]
[2025-03-08 02:02:07,329 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361955810] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 02:02:07,329 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153450723]
[2025-03-08 02:02:07,329 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:02:07,329 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 02:02:07,330 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 02:02:07,332 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 02:02:07,333 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-03-08 02:02:07,420 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes.
[2025-03-08 02:02:07,511 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements.
[2025-03-08 02:02:07,511 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:02:07,512 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:02:07,514 INFO  L256         TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-03-08 02:02:07,520 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 02:02:08,115 INFO  L134       CoverageAnalysis]: Checked inductivity of 723 backedges. 549 proven. 39 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked.
[2025-03-08 02:02:08,115 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 02:02:08,642 INFO  L134       CoverageAnalysis]: Checked inductivity of 723 backedges. 549 proven. 39 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked.
[2025-03-08 02:02:08,642 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [153450723] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 02:02:08,642 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-08 02:02:08,642 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8
[2025-03-08 02:02:08,642 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626651818]
[2025-03-08 02:02:08,642 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-08 02:02:08,643 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-08 02:02:08,643 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:02:08,644 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-08 02:02:08,644 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2025-03-08 02:02:08,644 INFO  L87              Difference]: Start difference. First operand 11155 states and 12145 transitions. Second operand  has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:12,799 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:02:12,799 INFO  L93              Difference]: Finished difference Result 29043 states and 31502 transitions.
[2025-03-08 02:02:12,799 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-03-08 02:02:12,800 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 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 594
[2025-03-08 02:02:12,800 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:02:12,818 INFO  L225             Difference]: With dead ends: 29043
[2025-03-08 02:02:12,818 INFO  L226             Difference]: Without dead ends: 12950
[2025-03-08 02:02:12,828 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1197 GetRequests, 1183 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240
[2025-03-08 02:02:12,828 INFO  L435           NwaCegarLoop]: 99 mSDtfsCounter, 2849 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 6395 mSolverCounterSat, 565 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2849 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 6960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 565 IncrementalHoareTripleChecker+Valid, 6395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time
[2025-03-08 02:02:12,828 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2849 Valid, 268 Invalid, 6960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [565 Valid, 6395 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time]
[2025-03-08 02:02:12,838 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12950 states.
[2025-03-08 02:02:12,929 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12950 to 12349.
[2025-03-08 02:02:12,937 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12349 states, 12348 states have (on average 1.036524133462909) internal successors, (12799), 12348 states have internal predecessors, (12799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:12,950 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12349 states to 12349 states and 12799 transitions.
[2025-03-08 02:02:12,951 INFO  L78                 Accepts]: Start accepts. Automaton has 12349 states and 12799 transitions. Word has length 594
[2025-03-08 02:02:12,951 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:02:12,951 INFO  L471      AbstractCegarLoop]: Abstraction has 12349 states and 12799 transitions.
[2025-03-08 02:02:12,951 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:12,951 INFO  L276                IsEmpty]: Start isEmpty. Operand 12349 states and 12799 transitions.
[2025-03-08 02:02:12,957 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 627
[2025-03-08 02:02:12,957 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:02:12,957 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:02:12,969 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-03-08 02:02:13,158 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 02:02:13,158 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:02:13,158 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:02:13,158 INFO  L85        PathProgramCache]: Analyzing trace with hash -485393049, now seen corresponding path program 1 times
[2025-03-08 02:02:13,159 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:02:13,159 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018453046]
[2025-03-08 02:02:13,159 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:02:13,159 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:02:13,227 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes.
[2025-03-08 02:02:13,254 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements.
[2025-03-08 02:02:13,255 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:02:13,255 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:02:13,489 INFO  L134       CoverageAnalysis]: Checked inductivity of 514 backedges. 408 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked.
[2025-03-08 02:02:13,489 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:02:13,489 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018453046]
[2025-03-08 02:02:13,489 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018453046] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:02:13,489 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:02:13,490 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:02:13,490 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808215203]
[2025-03-08 02:02:13,490 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:02:13,490 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:02:13,490 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:02:13,491 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:02:13,491 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:02:13,491 INFO  L87              Difference]: Start difference. First operand 12349 states and 12799 transitions. Second operand  has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:14,168 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:02:14,168 INFO  L93              Difference]: Finished difference Result 27990 states and 29066 transitions.
[2025-03-08 02:02:14,168 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:02:14,168 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 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 626
[2025-03-08 02:02:14,169 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:02:14,183 INFO  L225             Difference]: With dead ends: 27990
[2025-03-08 02:02:14,183 INFO  L226             Difference]: Without dead ends: 15942
[2025-03-08 02:02:14,192 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:02:14,192 INFO  L435           NwaCegarLoop]: 454 mSDtfsCounter, 117 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 02:02:14,192 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 486 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 02:02:14,202 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15942 states.
[2025-03-08 02:02:14,293 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15942 to 15640.
[2025-03-08 02:02:14,304 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15640 states, 15639 states have (on average 1.0351684890338257) internal successors, (16189), 15639 states have internal predecessors, (16189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:14,374 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15640 states to 15640 states and 16189 transitions.
[2025-03-08 02:02:14,374 INFO  L78                 Accepts]: Start accepts. Automaton has 15640 states and 16189 transitions. Word has length 626
[2025-03-08 02:02:14,375 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:02:14,375 INFO  L471      AbstractCegarLoop]: Abstraction has 15640 states and 16189 transitions.
[2025-03-08 02:02:14,375 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:14,375 INFO  L276                IsEmpty]: Start isEmpty. Operand 15640 states and 16189 transitions.
[2025-03-08 02:02:14,379 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 632
[2025-03-08 02:02:14,379 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:02:14,380 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 02:02:14,380 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-08 02:02:14,380 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:02:14,380 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:02:14,380 INFO  L85        PathProgramCache]: Analyzing trace with hash 729638859, now seen corresponding path program 1 times
[2025-03-08 02:02:14,380 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:02:14,380 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068553890]
[2025-03-08 02:02:14,381 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:02:14,381 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:02:14,421 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes.
[2025-03-08 02:02:14,444 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements.
[2025-03-08 02:02:14,444 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:02:14,444 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:02:14,565 INFO  L134       CoverageAnalysis]: Checked inductivity of 519 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked.
[2025-03-08 02:02:14,565 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:02:14,565 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068553890]
[2025-03-08 02:02:14,565 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068553890] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:02:14,565 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:02:14,565 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:02:14,565 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61725638]
[2025-03-08 02:02:14,565 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:02:14,566 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:02:14,566 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:02:14,566 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:02:14,566 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:02:14,566 INFO  L87              Difference]: Start difference. First operand 15640 states and 16189 transitions. Second operand  has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:15,205 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:02:15,205 INFO  L93              Difference]: Finished difference Result 33668 states and 34848 transitions.
[2025-03-08 02:02:15,206 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:02:15,206 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 631
[2025-03-08 02:02:15,206 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:02:15,223 INFO  L225             Difference]: With dead ends: 33668
[2025-03-08 02:02:15,223 INFO  L226             Difference]: Without dead ends: 18030
[2025-03-08 02:02:15,233 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:02:15,234 INFO  L435           NwaCegarLoop]: 486 mSDtfsCounter, 284 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 02:02:15,234 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 524 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 02:02:15,245 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18030 states.
[2025-03-08 02:02:15,339 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18030 to 17432.
[2025-03-08 02:02:15,351 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17432 states, 17431 states have (on average 1.031208765991624) internal successors, (17975), 17431 states have internal predecessors, (17975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:15,365 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17432 states to 17432 states and 17975 transitions.
[2025-03-08 02:02:15,366 INFO  L78                 Accepts]: Start accepts. Automaton has 17432 states and 17975 transitions. Word has length 631
[2025-03-08 02:02:15,366 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:02:15,367 INFO  L471      AbstractCegarLoop]: Abstraction has 17432 states and 17975 transitions.
[2025-03-08 02:02:15,367 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:15,367 INFO  L276                IsEmpty]: Start isEmpty. Operand 17432 states and 17975 transitions.
[2025-03-08 02:02:15,372 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 661
[2025-03-08 02:02:15,372 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:02:15,372 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 02:02:15,372 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-08 02:02:15,372 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:02:15,373 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:02:15,373 INFO  L85        PathProgramCache]: Analyzing trace with hash -108942432, now seen corresponding path program 1 times
[2025-03-08 02:02:15,373 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:02:15,373 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751952717]
[2025-03-08 02:02:15,373 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:02:15,373 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:02:15,436 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 660 statements into 1 equivalence classes.
[2025-03-08 02:02:15,460 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 660 of 660 statements.
[2025-03-08 02:02:15,460 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:02:15,460 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:02:15,622 INFO  L134       CoverageAnalysis]: Checked inductivity of 546 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked.
[2025-03-08 02:02:15,622 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:02:15,622 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751952717]
[2025-03-08 02:02:15,622 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751952717] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:02:15,622 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:02:15,622 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:02:15,622 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181559353]
[2025-03-08 02:02:15,622 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:02:15,623 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:02:15,623 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:02:15,623 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:02:15,623 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:02:15,623 INFO  L87              Difference]: Start difference. First operand 17432 states and 17975 transitions. Second operand  has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:16,308 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:02:16,308 INFO  L93              Difference]: Finished difference Result 37249 states and 38478 transitions.
[2025-03-08 02:02:16,308 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:02:16,308 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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 660
[2025-03-08 02:02:16,309 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:02:16,327 INFO  L225             Difference]: With dead ends: 37249
[2025-03-08 02:02:16,328 INFO  L226             Difference]: Without dead ends: 20118
[2025-03-08 02:02:16,338 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:02:16,338 INFO  L435           NwaCegarLoop]: 457 mSDtfsCounter, 313 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 02:02:16,339 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 496 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 02:02:16,350 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20118 states.
[2025-03-08 02:02:16,461 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20118 to 17425.
[2025-03-08 02:02:16,472 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17425 states, 17424 states have (on average 1.0289830119375574) internal successors, (17929), 17424 states have internal predecessors, (17929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:16,486 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17425 states to 17425 states and 17929 transitions.
[2025-03-08 02:02:16,487 INFO  L78                 Accepts]: Start accepts. Automaton has 17425 states and 17929 transitions. Word has length 660
[2025-03-08 02:02:16,487 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:02:16,487 INFO  L471      AbstractCegarLoop]: Abstraction has 17425 states and 17929 transitions.
[2025-03-08 02:02:16,487 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:16,487 INFO  L276                IsEmpty]: Start isEmpty. Operand 17425 states and 17929 transitions.
[2025-03-08 02:02:16,491 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 682
[2025-03-08 02:02:16,491 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:02:16,491 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 02:02:16,492 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-08 02:02:16,492 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:02:16,492 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:02:16,492 INFO  L85        PathProgramCache]: Analyzing trace with hash 464248262, now seen corresponding path program 1 times
[2025-03-08 02:02:16,492 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:02:16,492 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786081967]
[2025-03-08 02:02:16,492 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:02:16,492 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:02:16,559 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 681 statements into 1 equivalence classes.
[2025-03-08 02:02:16,582 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 681 of 681 statements.
[2025-03-08 02:02:16,582 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:02:16,583 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:02:16,712 INFO  L134       CoverageAnalysis]: Checked inductivity of 753 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked.
[2025-03-08 02:02:16,712 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:02:16,713 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786081967]
[2025-03-08 02:02:16,713 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786081967] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:02:16,713 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:02:16,713 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:02:16,713 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893224559]
[2025-03-08 02:02:16,713 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:02:16,713 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:02:16,713 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:02:16,714 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:02:16,714 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:02:16,714 INFO  L87              Difference]: Start difference. First operand 17425 states and 17929 transitions. Second operand  has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:17,326 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:02:17,327 INFO  L93              Difference]: Finished difference Result 35744 states and 36785 transitions.
[2025-03-08 02:02:17,328 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:02:17,328 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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 681
[2025-03-08 02:02:17,328 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:02:17,344 INFO  L225             Difference]: With dead ends: 35744
[2025-03-08 02:02:17,344 INFO  L226             Difference]: Without dead ends: 18620
[2025-03-08 02:02:17,353 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:02:17,353 INFO  L435           NwaCegarLoop]: 397 mSDtfsCounter, 363 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 02:02:17,353 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 416 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 02:02:17,362 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18620 states.
[2025-03-08 02:02:17,456 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18620 to 16826.
[2025-03-08 02:02:17,466 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 16826 states, 16825 states have (on average 1.0278751857355126) internal successors, (17294), 16825 states have internal predecessors, (17294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:17,479 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16826 states to 16826 states and 17294 transitions.
[2025-03-08 02:02:17,480 INFO  L78                 Accepts]: Start accepts. Automaton has 16826 states and 17294 transitions. Word has length 681
[2025-03-08 02:02:17,480 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:02:17,481 INFO  L471      AbstractCegarLoop]: Abstraction has 16826 states and 17294 transitions.
[2025-03-08 02:02:17,481 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:17,481 INFO  L276                IsEmpty]: Start isEmpty. Operand 16826 states and 17294 transitions.
[2025-03-08 02:02:17,489 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 837
[2025-03-08 02:02:17,489 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:02:17,490 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-03-08 02:02:17,490 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-08 02:02:17,490 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:02:17,490 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:02:17,490 INFO  L85        PathProgramCache]: Analyzing trace with hash 361144854, now seen corresponding path program 1 times
[2025-03-08 02:02:17,490 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:02:17,490 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61622832]
[2025-03-08 02:02:17,490 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:02:17,491 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:02:17,542 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 836 statements into 1 equivalence classes.
[2025-03-08 02:02:17,603 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 836 of 836 statements.
[2025-03-08 02:02:17,603 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:02:17,603 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:02:18,060 INFO  L134       CoverageAnalysis]: Checked inductivity of 1006 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked.
[2025-03-08 02:02:18,061 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:02:18,061 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61622832]
[2025-03-08 02:02:18,061 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61622832] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:02:18,061 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:02:18,061 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:02:18,061 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153124110]
[2025-03-08 02:02:18,061 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:02:18,061 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:02:18,061 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:02:18,062 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:02:18,062 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:02:18,062 INFO  L87              Difference]: Start difference. First operand 16826 states and 17294 transitions. Second operand  has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:18,753 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:02:18,753 INFO  L93              Difference]: Finished difference Result 37550 states and 38568 transitions.
[2025-03-08 02:02:18,753 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:02:18,753 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 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 836
[2025-03-08 02:02:18,754 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:02:18,773 INFO  L225             Difference]: With dead ends: 37550
[2025-03-08 02:02:18,773 INFO  L226             Difference]: Without dead ends: 20726
[2025-03-08 02:02:18,783 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:02:18,784 INFO  L435           NwaCegarLoop]: 98 mSDtfsCounter, 317 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 02:02:18,784 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 121 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 02:02:18,794 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20726 states.
[2025-03-08 02:02:18,901 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20726 to 17725.
[2025-03-08 02:02:18,912 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17725 states, 17724 states have (on average 1.026686978108779) internal successors, (18197), 17724 states have internal predecessors, (18197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:18,927 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17725 states to 17725 states and 18197 transitions.
[2025-03-08 02:02:18,927 INFO  L78                 Accepts]: Start accepts. Automaton has 17725 states and 18197 transitions. Word has length 836
[2025-03-08 02:02:18,928 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:02:18,928 INFO  L471      AbstractCegarLoop]: Abstraction has 17725 states and 18197 transitions.
[2025-03-08 02:02:18,928 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:18,928 INFO  L276                IsEmpty]: Start isEmpty. Operand 17725 states and 18197 transitions.
[2025-03-08 02:02:18,939 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 870
[2025-03-08 02:02:18,939 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:02:18,939 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:02:18,940 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-08 02:02:18,940 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:02:18,940 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:02:18,940 INFO  L85        PathProgramCache]: Analyzing trace with hash 1265273844, now seen corresponding path program 1 times
[2025-03-08 02:02:18,940 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:02:18,940 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755733719]
[2025-03-08 02:02:18,940 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:02:18,940 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:02:19,018 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 869 statements into 1 equivalence classes.
[2025-03-08 02:02:19,053 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 869 of 869 statements.
[2025-03-08 02:02:19,054 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:02:19,054 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:02:19,535 INFO  L134       CoverageAnalysis]: Checked inductivity of 1346 backedges. 704 proven. 0 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked.
[2025-03-08 02:02:19,535 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:02:19,535 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755733719]
[2025-03-08 02:02:19,535 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755733719] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 02:02:19,535 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 02:02:19,535 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-03-08 02:02:19,535 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640523843]
[2025-03-08 02:02:19,535 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 02:02:19,536 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-03-08 02:02:19,536 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:02:19,536 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-03-08 02:02:19,536 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:02:19,536 INFO  L87              Difference]: Start difference. First operand 17725 states and 18197 transitions. Second operand  has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:20,335 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:02:20,336 INFO  L93              Difference]: Finished difference Result 39346 states and 40361 transitions.
[2025-03-08 02:02:20,336 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-03-08 02:02:20,336 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 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 869
[2025-03-08 02:02:20,337 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:02:20,359 INFO  L225             Difference]: With dead ends: 39346
[2025-03-08 02:02:20,359 INFO  L226             Difference]: Without dead ends: 21922
[2025-03-08 02:02:20,372 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-03-08 02:02:20,373 INFO  L435           NwaCegarLoop]: 454 mSDtfsCounter, 146 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 02:02:20,373 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 481 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 02:02:20,388 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21922 states.
[2025-03-08 02:02:20,506 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21922 to 18324.
[2025-03-08 02:02:20,519 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18324 states, 18323 states have (on average 1.0260328548818425) internal successors, (18800), 18323 states have internal predecessors, (18800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:20,535 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18324 states to 18324 states and 18800 transitions.
[2025-03-08 02:02:20,535 INFO  L78                 Accepts]: Start accepts. Automaton has 18324 states and 18800 transitions. Word has length 869
[2025-03-08 02:02:20,536 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:02:20,536 INFO  L471      AbstractCegarLoop]: Abstraction has 18324 states and 18800 transitions.
[2025-03-08 02:02:20,536 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:20,536 INFO  L276                IsEmpty]: Start isEmpty. Operand 18324 states and 18800 transitions.
[2025-03-08 02:02:20,548 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 898
[2025-03-08 02:02:20,548 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:02:20,549 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:02:20,549 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-03-08 02:02:20,549 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:02:20,549 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:02:20,549 INFO  L85        PathProgramCache]: Analyzing trace with hash -1173366529, now seen corresponding path program 1 times
[2025-03-08 02:02:20,549 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:02:20,550 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809943372]
[2025-03-08 02:02:20,550 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:02:20,550 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:02:20,606 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 897 statements into 1 equivalence classes.
[2025-03-08 02:02:20,644 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 897 of 897 statements.
[2025-03-08 02:02:20,644 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:02:20,644 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:02:21,520 INFO  L134       CoverageAnalysis]: Checked inductivity of 1128 backedges. 697 proven. 269 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked.
[2025-03-08 02:02:21,521 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 02:02:21,521 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809943372]
[2025-03-08 02:02:21,521 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809943372] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 02:02:21,521 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195996356]
[2025-03-08 02:02:21,521 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:02:21,521 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 02:02:21,521 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 02:02:21,523 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 02:02:21,525 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-03-08 02:02:21,650 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 897 statements into 1 equivalence classes.
[2025-03-08 02:02:21,770 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 897 of 897 statements.
[2025-03-08 02:02:21,770 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:02:21,770 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 02:02:21,773 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 9 conjuncts are in the unsatisfiable core
[2025-03-08 02:02:21,782 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 02:02:23,786 INFO  L134       CoverageAnalysis]: Checked inductivity of 1128 backedges. 697 proven. 269 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked.
[2025-03-08 02:02:23,786 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-03-08 02:02:27,126 INFO  L134       CoverageAnalysis]: Checked inductivity of 1128 backedges. 697 proven. 269 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked.
[2025-03-08 02:02:27,127 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [195996356] provided 0 perfect and 2 imperfect interpolant sequences
[2025-03-08 02:02:27,127 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-03-08 02:02:27,127 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8
[2025-03-08 02:02:27,127 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798775280]
[2025-03-08 02:02:27,127 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-03-08 02:02:27,128 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-08 02:02:27,129 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 02:02:27,130 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-08 02:02:27,130 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2025-03-08 02:02:27,130 INFO  L87              Difference]: Start difference. First operand 18324 states and 18800 transitions. Second operand  has 9 states, 9 states have (on average 200.11111111111111) internal successors, (1801), 8 states have internal predecessors, (1801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:30,607 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 02:02:30,607 INFO  L93              Difference]: Finished difference Result 45951 states and 47095 transitions.
[2025-03-08 02:02:30,607 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-03-08 02:02:30,608 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 200.11111111111111) internal successors, (1801), 8 states have internal predecessors, (1801), 0 states have call successors, (0), 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 897
[2025-03-08 02:02:30,608 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 02:02:30,630 INFO  L225             Difference]: With dead ends: 45951
[2025-03-08 02:02:30,631 INFO  L226             Difference]: Without dead ends: 27928
[2025-03-08 02:02:30,636 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1803 GetRequests, 1789 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240
[2025-03-08 02:02:30,638 INFO  L435           NwaCegarLoop]: 47 mSDtfsCounter, 608 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 6011 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 6396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 6011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time
[2025-03-08 02:02:30,638 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 268 Invalid, 6396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 6011 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time]
[2025-03-08 02:02:30,651 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 27928 states.
[2025-03-08 02:02:30,782 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 27928 to 19222.
[2025-03-08 02:02:30,794 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19222 states, 19221 states have (on average 1.0258051089953697) internal successors, (19717), 19221 states have internal predecessors, (19717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:30,807 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19222 states to 19222 states and 19717 transitions.
[2025-03-08 02:02:30,808 INFO  L78                 Accepts]: Start accepts. Automaton has 19222 states and 19717 transitions. Word has length 897
[2025-03-08 02:02:30,808 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 02:02:30,808 INFO  L471      AbstractCegarLoop]: Abstraction has 19222 states and 19717 transitions.
[2025-03-08 02:02:30,809 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 200.11111111111111) internal successors, (1801), 8 states have internal predecessors, (1801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 02:02:30,809 INFO  L276                IsEmpty]: Start isEmpty. Operand 19222 states and 19717 transitions.
[2025-03-08 02:02:30,817 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 910
[2025-03-08 02:02:30,817 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 02:02:30,817 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:02:30,824 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-03-08 02:02:31,017 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 02:02:31,018 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 02:02:31,019 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 02:02:31,019 INFO  L85        PathProgramCache]: Analyzing trace with hash 1333127233, now seen corresponding path program 1 times
[2025-03-08 02:02:31,019 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 02:02:31,019 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539923890]
[2025-03-08 02:02:31,019 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 02:02:31,019 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 02:02:31,076 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 909 statements into 1 equivalence classes.
[2025-03-08 02:02:31,307 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 909 of 909 statements.
[2025-03-08 02:02:31,307 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:02:31,311 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-08 02:02:31,312 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-03-08 02:02:31,344 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 909 statements into 1 equivalence classes.
[2025-03-08 02:02:31,444 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 909 of 909 statements.
[2025-03-08 02:02:31,445 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 02:02:31,445 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-03-08 02:02:31,699 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-03-08 02:02:31,699 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-03-08 02:02:31,700 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-03-08 02:02:31,702 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-03-08 02:02:31,709 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-03-08 02:02:31,988 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-03-08 02:02:31,994 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:02:31 BoogieIcfgContainer
[2025-03-08 02:02:31,994 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-03-08 02:02:31,995 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-03-08 02:02:31,995 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-03-08 02:02:31,995 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-03-08 02:02:31,999 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:01:44" (3/4) ...
[2025-03-08 02:02:32,000 INFO  L140         WitnessPrinter]: Generating witness for reachability counterexample
[2025-03-08 02:02:32,256 INFO  L127   tionWitnessGenerator]: Generated YAML witness of length 911.
[2025-03-08 02:02:32,441 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-03-08 02:02:32,443 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-03-08 02:02:32,443 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-03-08 02:02:32,444 INFO  L158              Benchmark]: Toolchain (without parser) took 51328.18ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 106.8MB in the beginning and 82.1MB in the end (delta: 24.7MB). Peak memory consumption was 251.2MB. Max. memory is 16.1GB.
[2025-03-08 02:02:32,444 INFO  L158              Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-03-08 02:02:32,444 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 636.15ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 94.9MB in the end (delta: 11.5MB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB.
[2025-03-08 02:02:32,444 INFO  L158              Benchmark]: Boogie Procedure Inliner took 163.55ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 57.6MB in the end (delta: 37.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB.
[2025-03-08 02:02:32,444 INFO  L158              Benchmark]: Boogie Preprocessor took 252.86ms. Allocated memory is still 142.6MB. Free memory was 57.6MB in the beginning and 52.0MB in the end (delta: 5.6MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB.
[2025-03-08 02:02:32,444 INFO  L158              Benchmark]: IcfgBuilder took 2090.43ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 52.0MB in the beginning and 84.5MB in the end (delta: -32.5MB). Peak memory consumption was 112.4MB. Max. memory is 16.1GB.
[2025-03-08 02:02:32,444 INFO  L158              Benchmark]: TraceAbstraction took 47729.48ms. Allocated memory was 251.7MB in the beginning and 369.1MB in the end (delta: 117.4MB). Free memory was 84.5MB in the beginning and 178.9MB in the end (delta: -94.5MB). Peak memory consumption was 173.2MB. Max. memory is 16.1GB.
[2025-03-08 02:02:32,444 INFO  L158              Benchmark]: Witness Printer took 448.00ms. Allocated memory is still 369.1MB. Free memory was 178.9MB in the beginning and 82.1MB in the end (delta: 96.8MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB.
[2025-03-08 02:02:32,445 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 636.15ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 94.9MB in the end (delta: 11.5MB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 163.55ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 57.6MB in the end (delta: 37.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 252.86ms. Allocated memory is still 142.6MB. Free memory was 57.6MB in the beginning and 52.0MB in the end (delta: 5.6MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB.
 * IcfgBuilder took 2090.43ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 52.0MB in the beginning and 84.5MB in the end (delta: -32.5MB). Peak memory consumption was 112.4MB. Max. memory is 16.1GB.
 * TraceAbstraction took 47729.48ms. Allocated memory was 251.7MB in the beginning and 369.1MB in the end (delta: 117.4MB). Free memory was 84.5MB in the beginning and 178.9MB in the end (delta: -94.5MB). Peak memory consumption was 173.2MB. Max. memory is 16.1GB.
 * Witness Printer took 448.00ms. Allocated memory is still 369.1MB. Free memory was 178.9MB in the beginning and 82.1MB in the end (delta: 96.8MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - CounterExampleResult [Line: 107]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L18]                int inputD = 4;
[L19]                int inputB = 2;
[L20]                int inputE = 5;
[L21]                int inputA = 1;
[L22]                int inputF = 6;
[L23]                int inputC = 3;
[L26]                int a4 = -89;
[L27]                int a29 = -127;
[L28]                int a2 = 1;
[L29]                int a0 = -44;
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1773]              int output = -1;
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1776]  COND TRUE   1
[L1779]              int input;
[L1780]              input = __VERIFIER_nondet_int()
[L1781]  COND FALSE  !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L1784]  CALL, EXPR  calculate_output(input)
[L34]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L37]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L40]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L43]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L46]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L49]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L52]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L55]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L58]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L61]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L64]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L67]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L70]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L73]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L76]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L79]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L82]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L85]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L88]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L91]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L94]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L97]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L100]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L103]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L106]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L109]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L112]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L115]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L118]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L121]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L124]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L127]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L130]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L133]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L136]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L139]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L142]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L145]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L148]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L151]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L154]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L157]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L160]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L163]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L166]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L169]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L172]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L175]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L178]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  -61 < a0 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L181]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L184]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L187]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L190]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L193]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L196]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L199]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L202]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L205]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L208]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L211]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L214]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L218]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((input == 1) && (((a2==3) &&  a29 <=  -144 ) || (((a2==2) &&   ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29  && (a2==2))))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L224]   COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 4))) && (a2==1)) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L229]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (((a2==2) && ( a29 <=  -144  && (input == 3))) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L239]   COND FALSE  !((( a0 <=  -147  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && (a2==1))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L244]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 3)) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==4))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L251]   COND FALSE  !(((((a2==3) && ((input == 3) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ))) &&  -61 < a0 ) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L257]   COND FALSE  !(((((input == 5) && ((  ((-144 < a29) && (-16 >= a29))  && (a2==2)) || (( 43 < a29  && (a2==1)) || ((a2==2) &&  a29 <=  -144 )))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L263]   COND FALSE  !((((((  ((-144 < a29) && (-16 >= a29))  && (a2==4)) || (( 43 < a29  && (a2==3)) || ((a2==4) &&  a29 <=  -144 ))) && (input == 2)) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L270]   COND FALSE  !((( -61 < a0  && ((((a2==3) &&  a29 <=  -144 ) || ((  ((-16 < a29) && (43 >= a29))  && (a2==2)) || ( 43 < a29  && (a2==2)))) && (input == 2))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L276]   COND FALSE  !(((((a2==4) && ((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L283]   COND FALSE  !((((((input == 4) &&  43 < a29 ) && (a2==1)) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L288]   COND FALSE  !((( -61 < a0  && (((( 43 < a29  && (a2==4)) || ((a2==5) &&  a29 <=  -144 )) || (  ((-144 < a29) && (-16 >= a29))  && (a2==5))) && (input == 1))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L295]   COND FALSE  !(((  ((-147 < a0) && (-98 >= a0))  && (((input == 2) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) )) && (a2==3)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L302]   COND FALSE  !((((a2==2) && (((input == 5) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-147 < a0) && (-98 >= a0)) )) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L309]   COND FALSE  !((((((input == 5) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) && (a2==1)) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L316]   COND FALSE  !(((a2==4) && ( -61 < a0  && ( a4 <=  -86  && ((input == 5) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L330]   COND FALSE  !((((((input == 3) &&  -61 < a0 ) &&  a4 <=  -86 ) &&   ((-16 < a29) && (43 >= a29)) ) && (a2==5)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L337]   COND FALSE  !(((a2==1) && ( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 4) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L343]   COND FALSE  !((( -61 < a0  && ( 43 < a29  && ((input == 4) && (a2==5)))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L346]   COND FALSE  !(((((((a2==4) &&   ((-144 < a29) && (-16 >= a29)) ) || (((a2==3) &&  43 < a29 ) || ( a29 <=  -144  && (a2==4)))) && (input == 5)) &&  a0 <=  -147 ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L351]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 3) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) )) &&  a0 <=  -147 )) && (a2==3)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L360]   COND FALSE  !(( 43 < a29  && (( -61 < a0  && ( a4 <=  -86  && (input == 1))) && (a2==5))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L365]   COND FALSE  !((( a4 <=  -86  && ( 43 < a29  && ((input == 2) &&  -61 < a0 ))) && (a2==3)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L371]   COND FALSE  !(((((input == 6) && ((((a2==1) &&  43 < a29 ) || ( a29 <=  -144  && (a2==2))) || ((a2==2) &&   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L377]   COND FALSE  !(((((  ((-98 < a0) && (-61 >= a0))  && (input == 3)) && (a2==2)) &&   ((-86 < a4) && (-42 >= a4)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L383]   COND FALSE  !((((  ((-147 < a0) && (-98 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5))) && (a2==4)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L390]   COND FALSE  !(((( a4 <=  -86  && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 1))) && (a2==1)) &&  -61 < a0 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L394]   COND FALSE  !(( -61 < a0  && ((( 43 < a29  && (input == 6)) && (a2==5)) &&  a4 <=  -86 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L400]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-98 < a0) && (-61 >= a0))  && (((input == 3) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (a2==5)))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L413]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5)) &&   ((-86 < a4) && (-42 >= a4)) )) && (a2==4)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L418]   COND FALSE  !(( a4 <=  -86  && ( -61 < a0  && (((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && (a2==4)))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L425]   COND FALSE  !(((((((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) ||  43 < a29 ) && (input == 6)) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==5)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L432]   COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((a2==3) && (((input == 2) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) &&   ((-86 < a4) && (-42 >= a4)) ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L438]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 5) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 )) && (a2==5)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L443]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((a2==3) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 2))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L449]   COND FALSE  !(((((a2==3) && ((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 2))) &&  a0 <=  -147 ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L455]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5)) && (a2==5)) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L459]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-147 < a0) && (-98 >= a0)) )) && (a2==4)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L466]   COND FALSE  !(((((((a2==5) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==4)) || ((a2==5) &&  a29 <=  -144 ))) && (input == 2)) &&  a4 <=  -86 ) &&  -61 < a0 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L472]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((  ((-98 < a0) && (-61 >= a0))  && (input == 6)) && (a2==2))) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L478]   COND FALSE  !((  ((-16 < a29) && (43 >= a29))  && ( a4 <=  -86  && (((input == 6) &&  -61 < a0 ) && (a2==5)))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L484]   COND FALSE  !(((  ((-16 < a29) && (43 >= a29))  && (((input == 4) &&  -61 < a0 ) &&  a4 <=  -86 )) && (a2==5)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L489]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((input == 5) && (((  ((-16 < a29) && (43 >= a29))  && (a2==2)) || ((a2==2) &&  43 < a29 )) || ( a29 <=  -144  && (a2==3)))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L496]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && (((input == 1) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )) &&   ((-86 < a4) && (-42 >= a4)) )) && (a2==2)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L501]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-98 < a0) && (-61 >= a0))  && (((input == 6) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )) && (a2==2)))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L507]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-147 < a0) && (-98 >= a0))  && ((input == 3) && (((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ( 43 < a29  && (a2==1))) || ((a2==2) &&  a29 <=  -144 ))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L512]   COND FALSE  !(((( a0 <=  -147  && ((input == 2) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) && (a2==4)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L517]   COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && ((input == 4) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==1)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L524]   COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && ( a29 <=  -144  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 3) && (a2==5))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L530]   COND FALSE  !(((a2==4) && (  ((-86 < a4) && (-42 >= a4))  && (((input == 5) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&  a0 <=  -147 ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L539]   COND FALSE  !((((a2==5) && (  ((-98 < a0) && (-61 >= a0))  && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 2)))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L552]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==1) && ( a0 <=  -147  && (  ((-16 < a29) && (43 >= a29))  && (input == 5))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L556]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ( a0 <=  -147  && (((  ((-144 < a29) && (-16 >= a29))  && (a2==2)) || (((a2==1) &&  43 < a29 ) || ( a29 <=  -144  && (a2==2)))) && (input == 4)))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L567]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==2) && (((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 2)) &&   ((-98 < a0) && (-61 >= a0)) ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L579]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((a2==5) && ( 43 < a29  && (input == 3))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L584]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && (((a2==3) && (input == 4)) &&  43 < a29 ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L597]   COND FALSE  !(((  ((-147 < a0) && (-98 >= a0))  && ((((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ((a2==1) &&  43 < a29 )) || ((a2==2) &&  a29 <=  -144 )) && (input == 6))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L604]   COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) && (a2==3)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L616]   COND FALSE  !((((a2==2) && ((  ((-144 < a29) && (-16 >= a29))  && (input == 1)) &&   ((-86 < a4) && (-42 >= a4)) )) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L623]   COND FALSE  !(( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 6) && (((a2==4) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==3)) || ((a2==4) &&  a29 <=  -144 )))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L630]   COND FALSE  !(((((a2==1) && ((input == 5) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L637]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 4) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )))) && (a2==2)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L644]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==5) && (( a0 <=  -147  && (input == 2)) &&  43 < a29 ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L651]   COND FALSE  !(((a2==1) && (  ((-86 < a4) && (-42 >= a4))  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 3)) &&  a0 <=  -147 ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L662]   COND FALSE  !(((((a2==1) && ((input == 6) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L667]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (((a2==1) && ((input == 2) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-147 < a0) && (-98 >= a0)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L672]   COND FALSE  !(( a0 <=  -147  && ((a2==2) && (  ((-86 < a4) && (-42 >= a4))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 2))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L678]   COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && ((((( 43 < a29  && (a2==2)) || ((a2==3) &&  a29 <=  -144 )) || ((a2==3) &&   ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L685]   COND FALSE  !(((((a2==5) && ((input == 4) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L691]   COND FALSE  !(((a2==2) && (  ((-98 < a0) && (-61 >= a0))  && (( a29 <=  -144  && (input == 1)) &&   ((-86 < a4) && (-42 >= a4)) ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L697]   COND FALSE  !(((( a4 <=  -86  && ( -61 < a0  && (input == 5))) && (a2==5)) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L703]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 6)) && (a2==4)) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L717]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==5) && (  ((-98 < a0) && (-61 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 4))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L722]   COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && ((input == 4) &&   ((-98 < a0) && (-61 >= a0)) )) &&  a29 <=  -144 ) && (a2==2)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L728]   COND FALSE  !(((a2==1) && ((((input == 1) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) &&  a0 <=  -147 ) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L735]   COND FALSE  !(( a4 <=  -86  && ( -61 < a0  && (((((a2==4) &&  43 < a29 ) || ((a2==5) &&  a29 <=  -144 )) || (  ((-144 < a29) && (-16 >= a29))  && (a2==5))) && (input == 3)))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L742]   COND FALSE  !((((a2==5) && (((input == 5) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) ||  43 < a29 )) &&   ((-147 < a0) && (-98 >= a0)) )) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L745]   COND FALSE  !((((  ((-16 < a29) && (43 >= a29))  && ((input == 1) &&   ((-147 < a0) && (-98 >= a0)) )) && (a2==2)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L752]   COND FALSE  !((( a4 <=  -86  && ((input == 6) && ((((a2==2) &&   ((-16 < a29) && (43 >= a29)) ) || ((a2==2) &&  43 < a29 )) || ((a2==3) &&  a29 <=  -144 )))) &&  -61 < a0 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L758]   COND FALSE  !(((( -61 < a0  && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 5))) &&  a4 <=  -86 ) && (a2==3)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L764]   COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && (  ((-86 < a4) && (-42 >= a4))  && ((((a2==3) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==2)) || ((a2==3) &&  a29 <=  -144 ))) && (input == 5)))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L771]   COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((((input == 6) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==1)) &&  43 < a29 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L778]   COND FALSE  !(( a0 <=  -147  && ((((input == 6) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) && (a2==4)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L784]   COND FALSE  !(((((a2==1) && ((input == 2) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L789]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && ((a2==4) && ((input == 4) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L796]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 4) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) )) &&  a0 <=  -147 )) && (a2==3)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L803]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((( a29 <=  -144  && (a2==2)) || ((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ((a2==1) &&  43 < a29 ))) && (input == 4))) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L814]   COND FALSE  !(( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 1) && ((  ((-144 < a29) && (-16 >= a29))  && (a2==4)) || (( 43 < a29  && (a2==3)) || ((a2==4) &&  a29 <=  -144 )))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L821]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5)) && (a2==2))) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L827]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==3) && (  ((-147 < a0) && (-98 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L834]   COND FALSE  !(((a2==5) && ((( a0 <=  -147  && (input == 5)) &&  43 < a29 ) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L839]   COND FALSE  !((  ((-16 < a29) && (43 >= a29))  && ((  ((-86 < a4) && (-42 >= a4))  && ((a2==1) && (input == 3))) &&  a0 <=  -147 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L850]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-147 < a0) && (-98 >= a0))  && ((a2==4) && ((input == 4) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L855]   COND FALSE  !((( a4 <=  -86  && ((input == 3) && ((((a2==1) &&  43 < a29 ) || ( a29 <=  -144  && (a2==2))) || ((a2==2) &&   ((-144 < a29) && (-16 >= a29)) )))) &&  -61 < a0 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L861]   COND FALSE  !(((a2==4) && ((((input == 6) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L865]   COND FALSE  !(((a2==5) && ((((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 3)) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L872]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((((a2==3) &&   ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) &&  43 < a29 ) || ( a29 <=  -144  && (a2==3)))) && (input == 1))) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L878]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) &&  a0 <=  -147 ) && (a2==5))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L884]   COND FALSE  !(( a4 <=  -86  && ( -61 < a0  && ((input == 5) && ((( 43 < a29  && (a2==4)) || ( a29 <=  -144  && (a2==5))) || ((a2==5) &&   ((-144 < a29) && (-16 >= a29)) ))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L890]   COND FALSE  !(((a2==3) && ( a4 <=  -86  && (((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 1)) &&  -61 < a0 ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L895]   COND FALSE  !(((a2==5) && ((((input == 1) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L905]   COND FALSE  !((((( -61 < a0  && (input == 2)) &&  43 < a29 ) &&  a4 <=  -86 ) && (a2==5)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L911]   COND FALSE  !((((((input == 1) && (a2==1)) &&  43 < a29 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L917]   COND FALSE  !(((((a2==2) && ((input == 4) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L922]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 6) &&  43 < a29 ) && (a2==2))) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L929]   COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && ((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 3)) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==3))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L935]   COND FALSE  !(((  ((-147 < a0) && (-98 >= a0))  && (((input == 1) && (a2==5)) &&   ((-86 < a4) && (-42 >= a4)) )) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L940]   COND FALSE  !((((a2==1) && ( a0 <=  -147  && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 6)))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L945]   COND FALSE  !(((((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==4)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L952]   COND FALSE  !((((a2==1) && (((input == 5) &&   ((-86 < a4) && (-42 >= a4)) ) &&  43 < a29 )) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L958]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (  ((-98 < a0) && (-61 >= a0))  && ((input == 5) && (a2==2)))) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L965]   COND FALSE  !((( -61 < a0  && ((a2==1) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 3)))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L969]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((((a2==1) &&   ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29  && (a2==1))) || ((a2==2) &&  a29 <=  -144 )) && (input == 5)) &&   ((-147 < a0) && (-98 >= a0)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L976]   COND FALSE  !(((((  ((-147 < a0) && (-98 >= a0))  && (input == 4)) &&   ((-16 < a29) && (43 >= a29)) ) && (a2==2)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L983]   COND FALSE  !(( a4 <=  -86  && ((( 43 < a29  && (input == 5)) &&  -61 < a0 ) && (a2==3))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L989]   COND FALSE  !((((a2==4) && ( a4 <=  -86  && ((input == 3) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) )))) &&  -61 < a0 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L995]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 6)) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==1))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1002]  COND FALSE  !((((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 6)) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==2)) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1008]  COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && (((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) && (a2==4)))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1014]  COND FALSE  !((((((input == 1) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) ||  43 < a29 )) &&   ((-147 < a0) && (-98 >= a0)) ) && (a2==5)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1021]  COND FALSE  !((((  ((-98 < a0) && (-61 >= a0))  && ((input == 2) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) && (a2==3)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1026]  COND FALSE  !((((a2==4) && (  ((-86 < a4) && (-42 >= a4))  && ((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )))) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1029]  COND FALSE  !((((a2==2) && ((  ((-147 < a0) && (-98 >= a0))  && (input == 4)) &&   ((-86 < a4) && (-42 >= a4)) )) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1036]  COND FALSE  !(((a2==5) && (  ((-86 < a4) && (-42 >= a4))  && ((  ((-147 < a0) && (-98 >= a0))  && (input == 4)) &&  a29 <=  -144 ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1040]  COND FALSE  !(( a4 <=  -86  && ((((((a2==2) &&   ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29  && (a2==2))) || ((a2==3) &&  a29 <=  -144 )) && (input == 3)) &&  -61 < a0 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1045]  COND FALSE  !(((a2==2) && (  ((-86 < a4) && (-42 >= a4))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 1)) &&  a0 <=  -147 ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1048]  COND FALSE  !(( a0 <=  -147  && ((((((a2==3) &&  43 < a29 ) || ( a29 <=  -144  && (a2==4))) || ((a2==4) &&   ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1054]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (( a0 <=  -147  && ((a2==5) && (input == 1))) &&  43 < a29 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1059]  COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 3)) &&   ((-98 < a0) && (-61 >= a0)) )) && (a2==5)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1072]  COND FALSE  !((((a2==2) && (((input == 4) &&   ((-86 < a4) && (-42 >= a4)) ) &&  43 < a29 )) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1084]  COND FALSE  !(((((((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ( 43 < a29  && (a2==1))) || ((a2==2) &&  a29 <=  -144 )) && (input == 2)) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1091]  COND FALSE  !(( a4 <=  -86  && (((input == 6) && ((( 43 < a29  && (a2==1)) || ( a29 <=  -144  && (a2==2))) || ((a2==2) &&   ((-144 < a29) && (-16 >= a29)) ))) &&  -61 < a0 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1096]  COND FALSE  !(((a2==1) && (( 43 < a29  && ((input == 2) &&   ((-98 < a0) && (-61 >= a0)) )) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1101]  COND FALSE  !((((((input == 4) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )) &&  a4 <=  -86 ) && (a2==3)) &&  -61 < a0 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1108]  COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 2) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) && (a2==4))) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1118]  COND FALSE  !(((a2==2) && ((((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 3)) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1125]  COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((((input == 2) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (a2==4)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1132]  COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && (  ((-86 < a4) && (-42 >= a4))  && (((input == 2) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) ||  43 < a29 )) && (a2==5)))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1138]  COND FALSE  !(( 43 < a29  && ( a4 <=  -86  && ( -61 < a0  && ((a2==3) && (input == 3))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1144]  COND FALSE  !((((((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-147 < a0) && (-98 >= a0)) ) && (a2==3)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1155]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ( a0 <=  -147  && (((  ((-144 < a29) && (-16 >= a29))  && (a2==2)) || (( 43 < a29  && (a2==1)) || ((a2==2) &&  a29 <=  -144 ))) && (input == 1)))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1160]  COND FALSE  !(((a2==4) && ((((input == 3) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1166]  COND FALSE  !(((a2==4) && ((((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 1)) &&  a4 <=  -86 ) &&  -61 < a0 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1172]  COND FALSE  !((((a2==4) && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 4)) &&   ((-98 < a0) && (-61 >= a0)) )) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1178]  COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ( 43 < a29  && ((input == 3) && (a2==1)))) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1182]  COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((a2==1) && (  ((-86 < a4) && (-42 >= a4))  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 3))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1188]  COND FALSE  !(( a0 <=  -147  && (((((a2==2) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==1)) || ( a29 <=  -144  && (a2==2)))) && (input == 2)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1194]  COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && ((input == 2) && (a2==2))) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1200]  COND FALSE  !(((((  ((-98 < a0) && (-61 >= a0))  && (input == 2)) &&  a29 <=  -144 ) && (a2==2)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1207]  COND FALSE  !((((a2==5) && ( -61 < a0  && ((input == 5) &&  43 < a29 ))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1213]  COND FALSE  !((((( a0 <=  -147  && (input == 6)) && (a2==5)) &&  43 < a29 ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1218]  COND FALSE  !(( 43 < a29  && ((((input == 4) &&  a0 <=  -147 ) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==5))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1222]  COND FALSE  !(((  ((-147 < a0) && (-98 >= a0))  && ((a2==1) && ((input == 3) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1228]  COND FALSE  !(( -61 < a0  && (((input == 1) && ((( 43 < a29  && (a2==1)) || ( a29 <=  -144  && (a2==2))) || (  ((-144 < a29) && (-16 >= a29))  && (a2==2)))) &&  a4 <=  -86 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1234]  COND FALSE  !((((  ((-98 < a0) && (-61 >= a0))  && ((input == 6) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) && (a2==3)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1241]  COND FALSE  !(((a2==3) && ((  ((-98 < a0) && (-61 >= a0))  && ((input == 4) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1247]  COND FALSE  !(( -61 < a0  && ((((( 43 < a29  && (a2==1)) || ( a29 <=  -144  && (a2==2))) || (  ((-144 < a29) && (-16 >= a29))  && (a2==2))) && (input == 2)) &&  a4 <=  -86 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1253]  COND FALSE  !(((((input == 1) && (( a29 <=  -144  && (a2==2)) || ((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ((a2==1) &&  43 < a29 )))) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1259]  COND FALSE  !(((( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && (input == 3))) && (a2==5)) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1265]  COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 5)) &&  a0 <=  -147 )) && (a2==3)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1271]  COND FALSE  !(((a2==2) && ((((input == 3) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1274]  COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && (  ((-147 < a0) && (-98 >= a0))  && (input == 2))) && (a2==5)) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1281]  COND FALSE  !((( -61 < a0  && ((input == 5) && ((((a2==1) &&  43 < a29 ) || ((a2==2) &&  a29 <=  -144 )) || (  ((-144 < a29) && (-16 >= a29))  && (a2==2))))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1287]  COND FALSE  !(((a2==1) && ((((input == 1) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1293]  COND FALSE  !((((  ((-147 < a0) && (-98 >= a0))  && ((a2==2) && (input == 6))) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1299]  COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ( 43 < a29  && (((a2==2) && (input == 2)) &&   ((-86 < a4) && (-42 >= a4)) ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1310]  COND FALSE  !((((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 3)) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==3)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1316]  COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && ((  ((-86 < a4) && (-42 >= a4))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 4))) && (a2==3))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1323]  COND FALSE  !(((a2==1) && ((((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 6)) &&  a4 <=  -86 ) &&  -61 < a0 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1327]  COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && (((input == 5) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )) && (a2==1)))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1331]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((input == 5) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==4))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1343]  COND FALSE  !((( a0 <=  -147  && (((input == 1) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==1))) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1348]  COND FALSE  !((( -61 < a0  && ((((a2==5) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==4)) || ((a2==5) &&  a29 <=  -144 ))) && (input == 6))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1354]  COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && ((a2==5) && (((input == 4) && ( 43 < a29  || (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ))) &&   ((-86 < a4) && (-42 >= a4)) ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1360]  COND FALSE  !((( a0 <=  -147  && (((input == 4) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) )) && (a2==4)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1369]  COND FALSE  !((((((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 6)) &&  a4 <=  -86 ) && (a2==3)) &&  -61 < a0 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1375]  COND FALSE  !((((((input == 6) &&  a29 <=  -144 ) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==5)) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1381]  COND FALSE  !((((((input == 4) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) )) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==5)) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1388]  COND FALSE  !(( -61 < a0  && (((a2==3) && ( a4 <=  -86  && (input == 1))) &&  43 < a29 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1395]  COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 6) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) )) && (a2==5))) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1398]  COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((a2==4) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 4)))) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1404]  COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 5)) &&   ((-98 < a0) && (-61 >= a0)) )) && (a2==3)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1418]  COND FALSE  !(( a4 <=  -86  && ((((((a2==1) &&  43 < a29 ) || ((a2==2) &&  a29 <=  -144 )) || (  ((-144 < a29) && (-16 >= a29))  && (a2==2))) && (input == 4)) &&  -61 < a0 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1423]  COND FALSE  !((((a2==3) && (((input == 5) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) )) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1429]  COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && (((a2==3) && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 6))) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1441]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-147 < a0) && (-98 >= a0))  && ((a2==2) && (  ((-144 < a29) && (-16 >= a29))  && (input == 5))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1448]  COND FALSE  !(((((((a2==3) &&   ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) &&  43 < a29 ) || ((a2==3) &&  a29 <=  -144 ))) && (input == 6)) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1459]  COND FALSE  !(((a2==3) && (  ((-147 < a0) && (-98 >= a0))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 6)) &&   ((-86 < a4) && (-42 >= a4)) ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1466]  COND FALSE  !((((((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 1)) && (a2==3)) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1471]  COND FALSE  !(((a2==2) && ((  ((-98 < a0) && (-61 >= a0))  && ((input == 5) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ))) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1476]  COND FALSE  !(( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && ((a2==1) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 5))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1483]  COND FALSE  !(((((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 1)) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==4)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1488]  COND FALSE  !((((((input == 6) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==5)) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1492]  COND FALSE  !((( a0 <=  -147  && ((input == 3) && ((( 43 < a29  && (a2==1)) || ( a29 <=  -144  && (a2==2))) || ((a2==2) &&   ((-144 < a29) && (-16 >= a29)) )))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1498]  COND FALSE  !(( -61 < a0  && (((input == 4) && ((  ((-144 < a29) && (-16 >= a29))  && (a2==5)) || (((a2==4) &&  43 < a29 ) || ((a2==5) &&  a29 <=  -144 )))) &&  a4 <=  -86 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1504]  COND FALSE  !(((a2==4) && (  ((-147 < a0) && (-98 >= a0))  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 5)) &&   ((-86 < a4) && (-42 >= a4)) ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1511]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-98 < a0) && (-61 >= a0))  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 1)) && (a2==4)))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1518]  COND FALSE  !(((((  ((-86 < a4) && (-42 >= a4))  && (input == 5)) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==2)) &&  43 < a29 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1521]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==2) && (( 43 < a29  && (input == 1)) &&   ((-98 < a0) && (-61 >= a0)) ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1526]  COND FALSE  !(((a2==5) && (  ((-86 < a4) && (-42 >= a4))  && (  ((-98 < a0) && (-61 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 6))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1532]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==5) && (  ((-98 < a0) && (-61 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 1))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1538]  COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && (((a2==1) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 1))) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1543]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((((a2==2) &&  43 < a29 ) || ((a2==3) &&  a29 <=  -144 )) || ((a2==3) &&   ((-144 < a29) && (-16 >= a29)) )) && (input == 3)) &&   ((-147 < a0) && (-98 >= a0)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1550]  COND FALSE  !(( a0 <=  -147  && ((((a2==1) && (input == 4)) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-16 < a29) && (43 >= a29)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1557]  COND FALSE  !((  ((-16 < a29) && (43 >= a29))  && (  ((-147 < a0) && (-98 >= a0))  && ((a2==2) && ((input == 2) &&   ((-86 < a4) && (-42 >= a4)) )))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1564]  COND FALSE  !((((a2==1) && (((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 2)) &&  a4 <=  -86 )) &&  -61 < a0 ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1569]  COND FALSE  !(((a2==4) && ((  ((-86 < a4) && (-42 >= a4))  && ((input == 6) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) &&   ((-147 < a0) && (-98 >= a0)) )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1576]  COND FALSE  !((( a0 <=  -147  && (((input == 6) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==1))) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1580]  COND FALSE  !(( a4 <=  -86  && (((((a2==3) &&  a29 <=  -144 ) || (((a2==2) &&   ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29  && (a2==2)))) && (input == 4)) &&  -61 < a0 )))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1592]  COND FALSE  !((  ((-144 < a29) && (-16 >= a29))  && ((a2==2) && ((  ((-86 < a4) && (-42 >= a4))  && (input == 6)) &&   ((-147 < a0) && (-98 >= a0)) ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1599]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-147 < a0) && (-98 >= a0))  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 3)) && (a2==4)))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1605]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==5) && (((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 1)) &&  a0 <=  -147 ))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1612]  COND FALSE  !((((  ((-16 < a29) && (43 >= a29))  && (  ((-86 < a4) && (-42 >= a4))  && (input == 2))) &&  a0 <=  -147 ) && (a2==1)))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1616]  COND FALSE  !(((  ((-147 < a0) && (-98 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  && (input == 3)) && (a2==2))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1622]  COND FALSE  !(((a2==3) && (  ((-98 < a0) && (-61 >= a0))  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 1) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1633]  COND FALSE  !(( a4 <=  -86  && (( -61 < a0  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 6))) && (a2==4))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1639]  COND FALSE  !(( a4 <=  -86  && (  ((-16 < a29) && (43 >= a29))  && (( -61 < a0  && (input == 2)) && (a2==5)))))
         VAL         [a0=-44, a29=-127, a2=1, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1645]  COND TRUE   (((a2==1) && (((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 4)) &&  a4 <=  -86 )) &&  -61 < a0 )
[L1646]              a29 = (((a29 / 5) / 5) + 4459)
[L1647]              a2 = 2
[L1649]              return 22;
         VAL         [\result=22, a0=-44, a29=4454, a2=2, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1784]  RET, EXPR   calculate_output(input)
[L1784]              output = calculate_output(input)
[L1776]  COND TRUE   1
[L1779]              int input;
[L1780]              input = __VERIFIER_nondet_int()
[L1781]  COND FALSE  !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L1784]  CALL, EXPR  calculate_output(input)
[L34]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L37]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L40]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L43]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L46]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L49]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L52]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L55]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L58]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L61]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L64]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L67]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L70]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L73]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L76]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L79]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L82]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L85]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L88]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L91]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L94]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L97]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L100]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L103]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L106]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L109]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L112]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L115]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L118]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L121]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L124]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L127]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L130]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L133]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L136]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L139]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L142]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L145]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L148]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L151]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L154]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L157]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L160]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L163]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L166]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L169]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L172]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L175]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L178]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  -61 < a0 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L181]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L184]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L187]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L190]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L193]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L196]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L199]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L202]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L205]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L208]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L211]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L214]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L218]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((input == 1) && (((a2==3) &&  a29 <=  -144 ) || (((a2==2) &&   ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29  && (a2==2))))))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L224]   COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 4))) && (a2==1)) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L229]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (((a2==2) && ( a29 <=  -144  && (input == 3))) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L239]   COND FALSE  !((( a0 <=  -147  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && (a2==1))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L244]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 3)) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==4))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L251]   COND FALSE  !(((((a2==3) && ((input == 3) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ))) &&  -61 < a0 ) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L257]   COND FALSE  !(((((input == 5) && ((  ((-144 < a29) && (-16 >= a29))  && (a2==2)) || (( 43 < a29  && (a2==1)) || ((a2==2) &&  a29 <=  -144 )))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L263]   COND FALSE  !((((((  ((-144 < a29) && (-16 >= a29))  && (a2==4)) || (( 43 < a29  && (a2==3)) || ((a2==4) &&  a29 <=  -144 ))) && (input == 2)) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L270]   COND FALSE  !((( -61 < a0  && ((((a2==3) &&  a29 <=  -144 ) || ((  ((-16 < a29) && (43 >= a29))  && (a2==2)) || ( 43 < a29  && (a2==2)))) && (input == 2))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L276]   COND FALSE  !(((((a2==4) && ((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L283]   COND FALSE  !((((((input == 4) &&  43 < a29 ) && (a2==1)) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L288]   COND FALSE  !((( -61 < a0  && (((( 43 < a29  && (a2==4)) || ((a2==5) &&  a29 <=  -144 )) || (  ((-144 < a29) && (-16 >= a29))  && (a2==5))) && (input == 1))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L295]   COND FALSE  !(((  ((-147 < a0) && (-98 >= a0))  && (((input == 2) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) )) && (a2==3)))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L302]   COND FALSE  !((((a2==2) && (((input == 5) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-147 < a0) && (-98 >= a0)) )) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L309]   COND FALSE  !((((((input == 5) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) && (a2==1)) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L316]   COND FALSE  !(((a2==4) && ( -61 < a0  && ( a4 <=  -86  && ((input == 5) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L330]   COND FALSE  !((((((input == 3) &&  -61 < a0 ) &&  a4 <=  -86 ) &&   ((-16 < a29) && (43 >= a29)) ) && (a2==5)))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L337]   COND FALSE  !(((a2==1) && ( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 4) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L343]   COND FALSE  !((( -61 < a0  && ( 43 < a29  && ((input == 4) && (a2==5)))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L346]   COND FALSE  !(((((((a2==4) &&   ((-144 < a29) && (-16 >= a29)) ) || (((a2==3) &&  43 < a29 ) || ( a29 <=  -144  && (a2==4)))) && (input == 5)) &&  a0 <=  -147 ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L351]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 3) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) )) &&  a0 <=  -147 )) && (a2==3)))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L360]   COND FALSE  !(( 43 < a29  && (( -61 < a0  && ( a4 <=  -86  && (input == 1))) && (a2==5))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L365]   COND FALSE  !((( a4 <=  -86  && ( 43 < a29  && ((input == 2) &&  -61 < a0 ))) && (a2==3)))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L371]   COND FALSE  !(((((input == 6) && ((((a2==1) &&  43 < a29 ) || ( a29 <=  -144  && (a2==2))) || ((a2==2) &&   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L377]   COND FALSE  !(((((  ((-98 < a0) && (-61 >= a0))  && (input == 3)) && (a2==2)) &&   ((-86 < a4) && (-42 >= a4)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L383]   COND FALSE  !((((  ((-147 < a0) && (-98 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5))) && (a2==4)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L390]   COND FALSE  !(((( a4 <=  -86  && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 1))) && (a2==1)) &&  -61 < a0 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L394]   COND FALSE  !(( -61 < a0  && ((( 43 < a29  && (input == 6)) && (a2==5)) &&  a4 <=  -86 )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L400]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-98 < a0) && (-61 >= a0))  && (((input == 3) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (a2==5)))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L413]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5)) &&   ((-86 < a4) && (-42 >= a4)) )) && (a2==4)))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L418]   COND FALSE  !(( a4 <=  -86  && ( -61 < a0  && (((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && (a2==4)))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L425]   COND FALSE  !(((((((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) ||  43 < a29 ) && (input == 6)) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==5)))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L432]   COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((a2==3) && (((input == 2) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) &&   ((-86 < a4) && (-42 >= a4)) ))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L438]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 5) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 )) && (a2==5)))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L443]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((a2==3) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 2))))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L449]   COND FALSE  !(((((a2==3) && ((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 2))) &&  a0 <=  -147 ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L455]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5)) && (a2==5)) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L459]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-147 < a0) && (-98 >= a0)) )) && (a2==4)))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L466]   COND FALSE  !(((((((a2==5) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==4)) || ((a2==5) &&  a29 <=  -144 ))) && (input == 2)) &&  a4 <=  -86 ) &&  -61 < a0 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L472]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((  ((-98 < a0) && (-61 >= a0))  && (input == 6)) && (a2==2))) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L478]   COND FALSE  !((  ((-16 < a29) && (43 >= a29))  && ( a4 <=  -86  && (((input == 6) &&  -61 < a0 ) && (a2==5)))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L484]   COND FALSE  !(((  ((-16 < a29) && (43 >= a29))  && (((input == 4) &&  -61 < a0 ) &&  a4 <=  -86 )) && (a2==5)))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L489]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((input == 5) && (((  ((-16 < a29) && (43 >= a29))  && (a2==2)) || ((a2==2) &&  43 < a29 )) || ( a29 <=  -144  && (a2==3)))))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L496]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && (((input == 1) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )) &&   ((-86 < a4) && (-42 >= a4)) )) && (a2==2)))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L501]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-98 < a0) && (-61 >= a0))  && (((input == 6) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )) && (a2==2)))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L507]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-147 < a0) && (-98 >= a0))  && ((input == 3) && (((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ( 43 < a29  && (a2==1))) || ((a2==2) &&  a29 <=  -144 ))))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L512]   COND FALSE  !(((( a0 <=  -147  && ((input == 2) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) && (a2==4)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L517]   COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && ((input == 4) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==1)))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L524]   COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && ( a29 <=  -144  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 3) && (a2==5))))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L530]   COND FALSE  !(((a2==4) && (  ((-86 < a4) && (-42 >= a4))  && (((input == 5) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&  a0 <=  -147 ))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L539]   COND FALSE  !((((a2==5) && (  ((-98 < a0) && (-61 >= a0))  && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 2)))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L552]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==1) && ( a0 <=  -147  && (  ((-16 < a29) && (43 >= a29))  && (input == 5))))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L556]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ( a0 <=  -147  && (((  ((-144 < a29) && (-16 >= a29))  && (a2==2)) || (((a2==1) &&  43 < a29 ) || ( a29 <=  -144  && (a2==2)))) && (input == 4)))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L567]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==2) && (((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 2)) &&   ((-98 < a0) && (-61 >= a0)) ))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L579]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((a2==5) && ( 43 < a29  && (input == 3))))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L584]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && (((a2==3) && (input == 4)) &&  43 < a29 ))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L597]   COND FALSE  !(((  ((-147 < a0) && (-98 >= a0))  && ((((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ((a2==1) &&  43 < a29 )) || ((a2==2) &&  a29 <=  -144 )) && (input == 6))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L604]   COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) && (a2==3)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L616]   COND FALSE  !((((a2==2) && ((  ((-144 < a29) && (-16 >= a29))  && (input == 1)) &&   ((-86 < a4) && (-42 >= a4)) )) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L623]   COND FALSE  !(( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 6) && (((a2==4) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==3)) || ((a2==4) &&  a29 <=  -144 )))))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L630]   COND FALSE  !(((((a2==1) && ((input == 5) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L637]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 4) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )))) && (a2==2)))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L644]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==5) && (( a0 <=  -147  && (input == 2)) &&  43 < a29 ))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L651]   COND FALSE  !(((a2==1) && (  ((-86 < a4) && (-42 >= a4))  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 3)) &&  a0 <=  -147 ))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L662]   COND FALSE  !(((((a2==1) && ((input == 6) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L667]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (((a2==1) && ((input == 2) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-147 < a0) && (-98 >= a0)) )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L672]   COND FALSE  !(( a0 <=  -147  && ((a2==2) && (  ((-86 < a4) && (-42 >= a4))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 2))))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L678]   COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && ((((( 43 < a29  && (a2==2)) || ((a2==3) &&  a29 <=  -144 )) || ((a2==3) &&   ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L685]   COND FALSE  !(((((a2==5) && ((input == 4) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L691]   COND FALSE  !(((a2==2) && (  ((-98 < a0) && (-61 >= a0))  && (( a29 <=  -144  && (input == 1)) &&   ((-86 < a4) && (-42 >= a4)) ))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L697]   COND FALSE  !(((( a4 <=  -86  && ( -61 < a0  && (input == 5))) && (a2==5)) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L703]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 6)) && (a2==4)) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L717]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==5) && (  ((-98 < a0) && (-61 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 4))))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L722]   COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && ((input == 4) &&   ((-98 < a0) && (-61 >= a0)) )) &&  a29 <=  -144 ) && (a2==2)))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L728]   COND FALSE  !(((a2==1) && ((((input == 1) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) &&  a0 <=  -147 ) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L735]   COND FALSE  !(( a4 <=  -86  && ( -61 < a0  && (((((a2==4) &&  43 < a29 ) || ((a2==5) &&  a29 <=  -144 )) || (  ((-144 < a29) && (-16 >= a29))  && (a2==5))) && (input == 3)))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L742]   COND FALSE  !((((a2==5) && (((input == 5) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) ||  43 < a29 )) &&   ((-147 < a0) && (-98 >= a0)) )) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L745]   COND FALSE  !((((  ((-16 < a29) && (43 >= a29))  && ((input == 1) &&   ((-147 < a0) && (-98 >= a0)) )) && (a2==2)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L752]   COND FALSE  !((( a4 <=  -86  && ((input == 6) && ((((a2==2) &&   ((-16 < a29) && (43 >= a29)) ) || ((a2==2) &&  43 < a29 )) || ((a2==3) &&  a29 <=  -144 )))) &&  -61 < a0 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L758]   COND FALSE  !(((( -61 < a0  && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 5))) &&  a4 <=  -86 ) && (a2==3)))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L764]   COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && (  ((-86 < a4) && (-42 >= a4))  && ((((a2==3) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==2)) || ((a2==3) &&  a29 <=  -144 ))) && (input == 5)))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L771]   COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((((input == 6) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==1)) &&  43 < a29 )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L778]   COND FALSE  !(( a0 <=  -147  && ((((input == 6) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) && (a2==4)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L784]   COND FALSE  !(((((a2==1) && ((input == 2) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L789]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && ((a2==4) && ((input == 4) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L796]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 4) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) )) &&  a0 <=  -147 )) && (a2==3)))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L803]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((( a29 <=  -144  && (a2==2)) || ((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ((a2==1) &&  43 < a29 ))) && (input == 4))) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L814]   COND FALSE  !(( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 1) && ((  ((-144 < a29) && (-16 >= a29))  && (a2==4)) || (( 43 < a29  && (a2==3)) || ((a2==4) &&  a29 <=  -144 )))))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L821]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5)) && (a2==2))) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L827]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==3) && (  ((-147 < a0) && (-98 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5))))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L834]   COND FALSE  !(((a2==5) && ((( a0 <=  -147  && (input == 5)) &&  43 < a29 ) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L839]   COND FALSE  !((  ((-16 < a29) && (43 >= a29))  && ((  ((-86 < a4) && (-42 >= a4))  && ((a2==1) && (input == 3))) &&  a0 <=  -147 )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L850]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-147 < a0) && (-98 >= a0))  && ((a2==4) && ((input == 4) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L855]   COND FALSE  !((( a4 <=  -86  && ((input == 3) && ((((a2==1) &&  43 < a29 ) || ( a29 <=  -144  && (a2==2))) || ((a2==2) &&   ((-144 < a29) && (-16 >= a29)) )))) &&  -61 < a0 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L861]   COND FALSE  !(((a2==4) && ((((input == 6) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L865]   COND FALSE  !(((a2==5) && ((((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 3)) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L872]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((((a2==3) &&   ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) &&  43 < a29 ) || ( a29 <=  -144  && (a2==3)))) && (input == 1))) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L878]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) &&  a0 <=  -147 ) && (a2==5))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L884]   COND FALSE  !(( a4 <=  -86  && ( -61 < a0  && ((input == 5) && ((( 43 < a29  && (a2==4)) || ( a29 <=  -144  && (a2==5))) || ((a2==5) &&   ((-144 < a29) && (-16 >= a29)) ))))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L890]   COND FALSE  !(((a2==3) && ( a4 <=  -86  && (((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 1)) &&  -61 < a0 ))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L895]   COND FALSE  !(((a2==5) && ((((input == 1) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L905]   COND FALSE  !((((( -61 < a0  && (input == 2)) &&  43 < a29 ) &&  a4 <=  -86 ) && (a2==5)))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L911]   COND FALSE  !((((((input == 1) && (a2==1)) &&  43 < a29 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L917]   COND FALSE  !(((((a2==2) && ((input == 4) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L922]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 6) &&  43 < a29 ) && (a2==2))) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L929]   COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && ((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 3)) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==3))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L935]   COND FALSE  !(((  ((-147 < a0) && (-98 >= a0))  && (((input == 1) && (a2==5)) &&   ((-86 < a4) && (-42 >= a4)) )) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L940]   COND FALSE  !((((a2==1) && ( a0 <=  -147  && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 6)))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L945]   COND FALSE  !(((((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==4)))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L952]   COND FALSE  !((((a2==1) && (((input == 5) &&   ((-86 < a4) && (-42 >= a4)) ) &&  43 < a29 )) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L958]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (  ((-98 < a0) && (-61 >= a0))  && ((input == 5) && (a2==2)))) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L965]   COND FALSE  !((( -61 < a0  && ((a2==1) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 3)))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L969]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((((a2==1) &&   ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29  && (a2==1))) || ((a2==2) &&  a29 <=  -144 )) && (input == 5)) &&   ((-147 < a0) && (-98 >= a0)) )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L976]   COND FALSE  !(((((  ((-147 < a0) && (-98 >= a0))  && (input == 4)) &&   ((-16 < a29) && (43 >= a29)) ) && (a2==2)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L983]   COND FALSE  !(( a4 <=  -86  && ((( 43 < a29  && (input == 5)) &&  -61 < a0 ) && (a2==3))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L989]   COND FALSE  !((((a2==4) && ( a4 <=  -86  && ((input == 3) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) )))) &&  -61 < a0 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L995]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 6)) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==1))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1002]  COND FALSE  !((((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 6)) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==2)) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1008]  COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && (((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) && (a2==4)))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1014]  COND FALSE  !((((((input == 1) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) ||  43 < a29 )) &&   ((-147 < a0) && (-98 >= a0)) ) && (a2==5)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1021]  COND FALSE  !((((  ((-98 < a0) && (-61 >= a0))  && ((input == 2) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) && (a2==3)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1026]  COND FALSE  !((((a2==4) && (  ((-86 < a4) && (-42 >= a4))  && ((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )))) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1029]  COND FALSE  !((((a2==2) && ((  ((-147 < a0) && (-98 >= a0))  && (input == 4)) &&   ((-86 < a4) && (-42 >= a4)) )) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1036]  COND FALSE  !(((a2==5) && (  ((-86 < a4) && (-42 >= a4))  && ((  ((-147 < a0) && (-98 >= a0))  && (input == 4)) &&  a29 <=  -144 ))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1040]  COND FALSE  !(( a4 <=  -86  && ((((((a2==2) &&   ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29  && (a2==2))) || ((a2==3) &&  a29 <=  -144 )) && (input == 3)) &&  -61 < a0 )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1045]  COND FALSE  !(((a2==2) && (  ((-86 < a4) && (-42 >= a4))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 1)) &&  a0 <=  -147 ))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1048]  COND FALSE  !(( a0 <=  -147  && ((((((a2==3) &&  43 < a29 ) || ( a29 <=  -144  && (a2==4))) || ((a2==4) &&   ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1054]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (( a0 <=  -147  && ((a2==5) && (input == 1))) &&  43 < a29 )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1059]  COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 3)) &&   ((-98 < a0) && (-61 >= a0)) )) && (a2==5)))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1072]  COND FALSE  !((((a2==2) && (((input == 4) &&   ((-86 < a4) && (-42 >= a4)) ) &&  43 < a29 )) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1084]  COND FALSE  !(((((((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ( 43 < a29  && (a2==1))) || ((a2==2) &&  a29 <=  -144 )) && (input == 2)) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1091]  COND FALSE  !(( a4 <=  -86  && (((input == 6) && ((( 43 < a29  && (a2==1)) || ( a29 <=  -144  && (a2==2))) || ((a2==2) &&   ((-144 < a29) && (-16 >= a29)) ))) &&  -61 < a0 )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1096]  COND FALSE  !(((a2==1) && (( 43 < a29  && ((input == 2) &&   ((-98 < a0) && (-61 >= a0)) )) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1101]  COND FALSE  !((((((input == 4) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )) &&  a4 <=  -86 ) && (a2==3)) &&  -61 < a0 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1108]  COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 2) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) && (a2==4))) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1118]  COND FALSE  !(((a2==2) && ((((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 3)) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1125]  COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((((input == 2) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (a2==4)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1132]  COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && (  ((-86 < a4) && (-42 >= a4))  && (((input == 2) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) ||  43 < a29 )) && (a2==5)))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1138]  COND FALSE  !(( 43 < a29  && ( a4 <=  -86  && ( -61 < a0  && ((a2==3) && (input == 3))))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1144]  COND FALSE  !((((((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-147 < a0) && (-98 >= a0)) ) && (a2==3)))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1155]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ( a0 <=  -147  && (((  ((-144 < a29) && (-16 >= a29))  && (a2==2)) || (( 43 < a29  && (a2==1)) || ((a2==2) &&  a29 <=  -144 ))) && (input == 1)))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1160]  COND FALSE  !(((a2==4) && ((((input == 3) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1166]  COND FALSE  !(((a2==4) && ((((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 1)) &&  a4 <=  -86 ) &&  -61 < a0 )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1172]  COND FALSE  !((((a2==4) && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 4)) &&   ((-98 < a0) && (-61 >= a0)) )) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1178]  COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ( 43 < a29  && ((input == 3) && (a2==1)))) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1182]  COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((a2==1) && (  ((-86 < a4) && (-42 >= a4))  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 3))))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1188]  COND FALSE  !(( a0 <=  -147  && (((((a2==2) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==1)) || ( a29 <=  -144  && (a2==2)))) && (input == 2)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1194]  COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && ((input == 2) && (a2==2))) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1200]  COND FALSE  !(((((  ((-98 < a0) && (-61 >= a0))  && (input == 2)) &&  a29 <=  -144 ) && (a2==2)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1207]  COND FALSE  !((((a2==5) && ( -61 < a0  && ((input == 5) &&  43 < a29 ))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1213]  COND FALSE  !((((( a0 <=  -147  && (input == 6)) && (a2==5)) &&  43 < a29 ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1218]  COND FALSE  !(( 43 < a29  && ((((input == 4) &&  a0 <=  -147 ) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==5))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1222]  COND FALSE  !(((  ((-147 < a0) && (-98 >= a0))  && ((a2==1) && ((input == 3) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1228]  COND FALSE  !(( -61 < a0  && (((input == 1) && ((( 43 < a29  && (a2==1)) || ( a29 <=  -144  && (a2==2))) || (  ((-144 < a29) && (-16 >= a29))  && (a2==2)))) &&  a4 <=  -86 )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1234]  COND FALSE  !((((  ((-98 < a0) && (-61 >= a0))  && ((input == 6) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) && (a2==3)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1241]  COND FALSE  !(((a2==3) && ((  ((-98 < a0) && (-61 >= a0))  && ((input == 4) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1247]  COND FALSE  !(( -61 < a0  && ((((( 43 < a29  && (a2==1)) || ( a29 <=  -144  && (a2==2))) || (  ((-144 < a29) && (-16 >= a29))  && (a2==2))) && (input == 2)) &&  a4 <=  -86 )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1253]  COND FALSE  !(((((input == 1) && (( a29 <=  -144  && (a2==2)) || ((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ((a2==1) &&  43 < a29 )))) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1259]  COND FALSE  !(((( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && (input == 3))) && (a2==5)) &&  43 < a29 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1265]  COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 5)) &&  a0 <=  -147 )) && (a2==3)))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1271]  COND FALSE  !(((a2==2) && ((((input == 3) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1274]  COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && (  ((-147 < a0) && (-98 >= a0))  && (input == 2))) && (a2==5)) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1281]  COND FALSE  !((( -61 < a0  && ((input == 5) && ((((a2==1) &&  43 < a29 ) || ((a2==2) &&  a29 <=  -144 )) || (  ((-144 < a29) && (-16 >= a29))  && (a2==2))))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1287]  COND FALSE  !(((a2==1) && ((((input == 1) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1293]  COND FALSE  !((((  ((-147 < a0) && (-98 >= a0))  && ((a2==2) && (input == 6))) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1299]  COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ( 43 < a29  && (((a2==2) && (input == 2)) &&   ((-86 < a4) && (-42 >= a4)) ))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1310]  COND FALSE  !((((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 3)) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==3)))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1316]  COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && ((  ((-86 < a4) && (-42 >= a4))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 4))) && (a2==3))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1323]  COND FALSE  !(((a2==1) && ((((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 6)) &&  a4 <=  -86 ) &&  -61 < a0 )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1327]  COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && (((input == 5) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )) && (a2==1)))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1331]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((input == 5) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==4))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1343]  COND FALSE  !((( a0 <=  -147  && (((input == 1) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==1))) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1348]  COND FALSE  !((( -61 < a0  && ((((a2==5) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==4)) || ((a2==5) &&  a29 <=  -144 ))) && (input == 6))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1354]  COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && ((a2==5) && (((input == 4) && ( 43 < a29  || (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ))) &&   ((-86 < a4) && (-42 >= a4)) ))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1360]  COND FALSE  !((( a0 <=  -147  && (((input == 4) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) )) && (a2==4)))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1369]  COND FALSE  !((((((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 6)) &&  a4 <=  -86 ) && (a2==3)) &&  -61 < a0 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1375]  COND FALSE  !((((((input == 6) &&  a29 <=  -144 ) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==5)) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1381]  COND FALSE  !((((((input == 4) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) )) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==5)) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1388]  COND FALSE  !(( -61 < a0  && (((a2==3) && ( a4 <=  -86  && (input == 1))) &&  43 < a29 )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1395]  COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 6) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) )) && (a2==5))) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1398]  COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((a2==4) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 4)))) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1404]  COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 5)) &&   ((-98 < a0) && (-61 >= a0)) )) && (a2==3)))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1418]  COND FALSE  !(( a4 <=  -86  && ((((((a2==1) &&  43 < a29 ) || ((a2==2) &&  a29 <=  -144 )) || (  ((-144 < a29) && (-16 >= a29))  && (a2==2))) && (input == 4)) &&  -61 < a0 )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1423]  COND FALSE  !((((a2==3) && (((input == 5) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) )) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1429]  COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && (((a2==3) && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 6))) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1441]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-147 < a0) && (-98 >= a0))  && ((a2==2) && (  ((-144 < a29) && (-16 >= a29))  && (input == 5))))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1448]  COND FALSE  !(((((((a2==3) &&   ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) &&  43 < a29 ) || ((a2==3) &&  a29 <=  -144 ))) && (input == 6)) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1459]  COND FALSE  !(((a2==3) && (  ((-147 < a0) && (-98 >= a0))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 6)) &&   ((-86 < a4) && (-42 >= a4)) ))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1466]  COND FALSE  !((((((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 1)) && (a2==3)) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1471]  COND FALSE  !(((a2==2) && ((  ((-98 < a0) && (-61 >= a0))  && ((input == 5) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ))) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1476]  COND FALSE  !(( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && ((a2==1) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 5))))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1483]  COND FALSE  !(((((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 1)) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==4)))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1488]  COND FALSE  !((((((input == 6) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==5)) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1492]  COND FALSE  !((( a0 <=  -147  && ((input == 3) && ((( 43 < a29  && (a2==1)) || ( a29 <=  -144  && (a2==2))) || ((a2==2) &&   ((-144 < a29) && (-16 >= a29)) )))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1498]  COND FALSE  !(( -61 < a0  && (((input == 4) && ((  ((-144 < a29) && (-16 >= a29))  && (a2==5)) || (((a2==4) &&  43 < a29 ) || ((a2==5) &&  a29 <=  -144 )))) &&  a4 <=  -86 )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1504]  COND FALSE  !(((a2==4) && (  ((-147 < a0) && (-98 >= a0))  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 5)) &&   ((-86 < a4) && (-42 >= a4)) ))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1511]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-98 < a0) && (-61 >= a0))  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 1)) && (a2==4)))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1518]  COND FALSE  !(((((  ((-86 < a4) && (-42 >= a4))  && (input == 5)) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==2)) &&  43 < a29 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1521]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==2) && (( 43 < a29  && (input == 1)) &&   ((-98 < a0) && (-61 >= a0)) ))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1526]  COND FALSE  !(((a2==5) && (  ((-86 < a4) && (-42 >= a4))  && (  ((-98 < a0) && (-61 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 6))))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1532]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==5) && (  ((-98 < a0) && (-61 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 1))))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1538]  COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && (((a2==1) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 1))) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1543]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((((a2==2) &&  43 < a29 ) || ((a2==3) &&  a29 <=  -144 )) || ((a2==3) &&   ((-144 < a29) && (-16 >= a29)) )) && (input == 3)) &&   ((-147 < a0) && (-98 >= a0)) )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1550]  COND FALSE  !(( a0 <=  -147  && ((((a2==1) && (input == 4)) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-16 < a29) && (43 >= a29)) )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1557]  COND FALSE  !((  ((-16 < a29) && (43 >= a29))  && (  ((-147 < a0) && (-98 >= a0))  && ((a2==2) && ((input == 2) &&   ((-86 < a4) && (-42 >= a4)) )))))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1564]  COND FALSE  !((((a2==1) && (((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 2)) &&  a4 <=  -86 )) &&  -61 < a0 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1569]  COND FALSE  !(((a2==4) && ((  ((-86 < a4) && (-42 >= a4))  && ((input == 6) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) &&   ((-147 < a0) && (-98 >= a0)) )))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1576]  COND FALSE  !((( a0 <=  -147  && (((input == 6) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==1))) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1580]  COND TRUE   ( a4 <=  -86  && (((((a2==3) &&  a29 <=  -144 ) || (((a2==2) &&   ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29  && (a2==2)))) && (input == 4)) &&  -61 < a0 ))
         VAL         [a0=-44, a29=4454, a2=2, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1581]  COND FALSE  !((a2==1))
[L1588]              a29 = (((((a29 * 9)/ 10) / 5) % 29)- -13)
[L1589]              a2 = 5
         VAL         [a0=-44, a29=31, a2=5, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1591]              return 26;
         VAL         [\result=26, a0=-44, a29=31, a2=5, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1784]  RET, EXPR   calculate_output(input)
[L1784]              output = calculate_output(input)
[L1776]  COND TRUE   1
[L1779]              int input;
[L1780]              input = __VERIFIER_nondet_int()
[L1781]  COND FALSE  !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L1784]  CALL, EXPR  calculate_output(input)
[L34]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L37]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L40]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L43]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L46]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L49]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L52]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L55]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L58]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L61]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L64]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L67]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L70]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L73]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L76]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L79]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L82]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L85]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L88]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L91]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L94]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L97]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L100]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L103]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L106]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L109]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L112]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L115]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L118]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L121]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L124]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L127]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L130]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L133]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L136]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L139]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L142]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L145]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L148]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L151]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L154]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L157]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L160]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L163]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L166]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L169]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L172]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L175]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L178]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  -61 < a0 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L181]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L184]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L187]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L190]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L193]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L196]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L199]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L202]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L205]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L208]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L211]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L214]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L218]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((input == 1) && (((a2==3) &&  a29 <=  -144 ) || (((a2==2) &&   ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29  && (a2==2))))))))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L224]   COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 4))) && (a2==1)) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L229]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (((a2==2) && ( a29 <=  -144  && (input == 3))) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L239]   COND FALSE  !((( a0 <=  -147  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && (a2==1))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L244]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 3)) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==4))))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L251]   COND FALSE  !(((((a2==3) && ((input == 3) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ))) &&  -61 < a0 ) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L257]   COND FALSE  !(((((input == 5) && ((  ((-144 < a29) && (-16 >= a29))  && (a2==2)) || (( 43 < a29  && (a2==1)) || ((a2==2) &&  a29 <=  -144 )))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L263]   COND FALSE  !((((((  ((-144 < a29) && (-16 >= a29))  && (a2==4)) || (( 43 < a29  && (a2==3)) || ((a2==4) &&  a29 <=  -144 ))) && (input == 2)) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L270]   COND FALSE  !((( -61 < a0  && ((((a2==3) &&  a29 <=  -144 ) || ((  ((-16 < a29) && (43 >= a29))  && (a2==2)) || ( 43 < a29  && (a2==2)))) && (input == 2))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L276]   COND FALSE  !(((((a2==4) && ((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L283]   COND FALSE  !((((((input == 4) &&  43 < a29 ) && (a2==1)) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L288]   COND FALSE  !((( -61 < a0  && (((( 43 < a29  && (a2==4)) || ((a2==5) &&  a29 <=  -144 )) || (  ((-144 < a29) && (-16 >= a29))  && (a2==5))) && (input == 1))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L295]   COND FALSE  !(((  ((-147 < a0) && (-98 >= a0))  && (((input == 2) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) )) && (a2==3)))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L302]   COND FALSE  !((((a2==2) && (((input == 5) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-147 < a0) && (-98 >= a0)) )) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L309]   COND FALSE  !((((((input == 5) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) && (a2==1)) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L316]   COND FALSE  !(((a2==4) && ( -61 < a0  && ( a4 <=  -86  && ((input == 5) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))))))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L330]   COND FALSE  !((((((input == 3) &&  -61 < a0 ) &&  a4 <=  -86 ) &&   ((-16 < a29) && (43 >= a29)) ) && (a2==5)))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L337]   COND FALSE  !(((a2==1) && ( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 4) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))))))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L343]   COND FALSE  !((( -61 < a0  && ( 43 < a29  && ((input == 4) && (a2==5)))) &&  a4 <=  -86 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L346]   COND FALSE  !(((((((a2==4) &&   ((-144 < a29) && (-16 >= a29)) ) || (((a2==3) &&  43 < a29 ) || ( a29 <=  -144  && (a2==4)))) && (input == 5)) &&  a0 <=  -147 ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L351]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 3) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) )) &&  a0 <=  -147 )) && (a2==3)))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L360]   COND FALSE  !(( 43 < a29  && (( -61 < a0  && ( a4 <=  -86  && (input == 1))) && (a2==5))))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L365]   COND FALSE  !((( a4 <=  -86  && ( 43 < a29  && ((input == 2) &&  -61 < a0 ))) && (a2==3)))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L371]   COND FALSE  !(((((input == 6) && ((((a2==1) &&  43 < a29 ) || ( a29 <=  -144  && (a2==2))) || ((a2==2) &&   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L377]   COND FALSE  !(((((  ((-98 < a0) && (-61 >= a0))  && (input == 3)) && (a2==2)) &&   ((-86 < a4) && (-42 >= a4)) ) &&  43 < a29 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L383]   COND FALSE  !((((  ((-147 < a0) && (-98 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5))) && (a2==4)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L390]   COND FALSE  !(((( a4 <=  -86  && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 1))) && (a2==1)) &&  -61 < a0 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L394]   COND FALSE  !(( -61 < a0  && ((( 43 < a29  && (input == 6)) && (a2==5)) &&  a4 <=  -86 )))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L400]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-98 < a0) && (-61 >= a0))  && (((input == 3) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (a2==5)))))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L413]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5)) &&   ((-86 < a4) && (-42 >= a4)) )) && (a2==4)))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L418]   COND FALSE  !(( a4 <=  -86  && ( -61 < a0  && (((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && (a2==4)))))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L425]   COND FALSE  !(((((((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) ||  43 < a29 ) && (input == 6)) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==5)))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L432]   COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((a2==3) && (((input == 2) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) &&   ((-86 < a4) && (-42 >= a4)) ))))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L438]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 5) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 )) && (a2==5)))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L443]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((a2==3) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 2))))))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L449]   COND FALSE  !(((((a2==3) && ((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 2))) &&  a0 <=  -147 ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L455]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5)) && (a2==5)) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L459]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-147 < a0) && (-98 >= a0)) )) && (a2==4)))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L466]   COND FALSE  !(((((((a2==5) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==4)) || ((a2==5) &&  a29 <=  -144 ))) && (input == 2)) &&  a4 <=  -86 ) &&  -61 < a0 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L472]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((  ((-98 < a0) && (-61 >= a0))  && (input == 6)) && (a2==2))) &&  a29 <=  -144 ))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L478]   COND FALSE  !((  ((-16 < a29) && (43 >= a29))  && ( a4 <=  -86  && (((input == 6) &&  -61 < a0 ) && (a2==5)))))
         VAL         [a0=-44, a29=31, a2=5, a4=-89, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L484]   COND TRUE   ((  ((-16 < a29) && (43 >= a29))  && (((input == 4) &&  -61 < a0 ) &&  a4 <=  -86 )) && (a2==5))
[L485]               a4 = ((((a4 / 5) - -571961) % 21)+ -67)
[L486]               a0 = ((((a0 % 299926)+ -300072) * 1) - 2)
[L487]               a29 = ((((a29 - -174449) * 10)/ 9) / 5)
[L488]               return 22;
         VAL         [\result=22, a0=-300118, a29=38773, a2=5, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1784]  RET, EXPR   calculate_output(input)
[L1784]              output = calculate_output(input)
[L1776]  COND TRUE   1
[L1779]              int input;
[L1780]              input = __VERIFIER_nondet_int()
[L1781]  COND FALSE  !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L1784]  CALL, EXPR  calculate_output(input)
[L34]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L37]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L40]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L43]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L46]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L49]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L52]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L55]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L58]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L61]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L64]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L67]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L70]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L73]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L76]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L79]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L82]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L85]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L88]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L91]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L94]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L97]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L100]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L103]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L106]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L109]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L112]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L115]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L118]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L121]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L124]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L127]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L130]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L133]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L136]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L139]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L142]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L145]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L148]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L151]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L154]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L157]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L160]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L163]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L166]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L169]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L172]   COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L175]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L178]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  -61 < a0 ) &&  a29 <=  -144 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L181]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L184]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L187]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L190]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L193]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L196]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L199]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L202]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L205]   COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L208]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L211]   COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L214]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L218]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((input == 1) && (((a2==3) &&  a29 <=  -144 ) || (((a2==2) &&   ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29  && (a2==2))))))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L224]   COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 4))) && (a2==1)) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L229]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (((a2==2) && ( a29 <=  -144  && (input == 3))) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L239]   COND FALSE  !((( a0 <=  -147  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) && (a2==1))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L244]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 3)) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==4))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L251]   COND FALSE  !(((((a2==3) && ((input == 3) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ))) &&  -61 < a0 ) &&  a4 <=  -86 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L257]   COND FALSE  !(((((input == 5) && ((  ((-144 < a29) && (-16 >= a29))  && (a2==2)) || (( 43 < a29  && (a2==1)) || ((a2==2) &&  a29 <=  -144 )))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L263]   COND FALSE  !((((((  ((-144 < a29) && (-16 >= a29))  && (a2==4)) || (( 43 < a29  && (a2==3)) || ((a2==4) &&  a29 <=  -144 ))) && (input == 2)) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L270]   COND FALSE  !((( -61 < a0  && ((((a2==3) &&  a29 <=  -144 ) || ((  ((-16 < a29) && (43 >= a29))  && (a2==2)) || ( 43 < a29  && (a2==2)))) && (input == 2))) &&  a4 <=  -86 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L276]   COND FALSE  !(((((a2==4) && ((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L283]   COND FALSE  !((((((input == 4) &&  43 < a29 ) && (a2==1)) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L288]   COND FALSE  !((( -61 < a0  && (((( 43 < a29  && (a2==4)) || ((a2==5) &&  a29 <=  -144 )) || (  ((-144 < a29) && (-16 >= a29))  && (a2==5))) && (input == 1))) &&  a4 <=  -86 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L295]   COND FALSE  !(((  ((-147 < a0) && (-98 >= a0))  && (((input == 2) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) )) && (a2==3)))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L302]   COND FALSE  !((((a2==2) && (((input == 5) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-147 < a0) && (-98 >= a0)) )) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L309]   COND FALSE  !((((((input == 5) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) && (a2==1)) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L316]   COND FALSE  !(((a2==4) && ( -61 < a0  && ( a4 <=  -86  && ((input == 5) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L330]   COND FALSE  !((((((input == 3) &&  -61 < a0 ) &&  a4 <=  -86 ) &&   ((-16 < a29) && (43 >= a29)) ) && (a2==5)))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L337]   COND FALSE  !(((a2==1) && ( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 4) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L343]   COND FALSE  !((( -61 < a0  && ( 43 < a29  && ((input == 4) && (a2==5)))) &&  a4 <=  -86 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L346]   COND FALSE  !(((((((a2==4) &&   ((-144 < a29) && (-16 >= a29)) ) || (((a2==3) &&  43 < a29 ) || ( a29 <=  -144  && (a2==4)))) && (input == 5)) &&  a0 <=  -147 ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L351]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 3) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) )) &&  a0 <=  -147 )) && (a2==3)))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L360]   COND FALSE  !(( 43 < a29  && (( -61 < a0  && ( a4 <=  -86  && (input == 1))) && (a2==5))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L365]   COND FALSE  !((( a4 <=  -86  && ( 43 < a29  && ((input == 2) &&  -61 < a0 ))) && (a2==3)))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L371]   COND FALSE  !(((((input == 6) && ((((a2==1) &&  43 < a29 ) || ( a29 <=  -144  && (a2==2))) || ((a2==2) &&   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L377]   COND FALSE  !(((((  ((-98 < a0) && (-61 >= a0))  && (input == 3)) && (a2==2)) &&   ((-86 < a4) && (-42 >= a4)) ) &&  43 < a29 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L383]   COND FALSE  !((((  ((-147 < a0) && (-98 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5))) && (a2==4)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L390]   COND FALSE  !(((( a4 <=  -86  && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 1))) && (a2==1)) &&  -61 < a0 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L394]   COND FALSE  !(( -61 < a0  && ((( 43 < a29  && (input == 6)) && (a2==5)) &&  a4 <=  -86 )))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L400]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-98 < a0) && (-61 >= a0))  && (((input == 3) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (a2==5)))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L413]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5)) &&   ((-86 < a4) && (-42 >= a4)) )) && (a2==4)))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L418]   COND FALSE  !(( a4 <=  -86  && ( -61 < a0  && (((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 4)) && (a2==4)))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L425]   COND FALSE  !(((((((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) ||  43 < a29 ) && (input == 6)) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==5)))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L432]   COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((a2==3) && (((input == 2) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) &&   ((-86 < a4) && (-42 >= a4)) ))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L438]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 5) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 )) && (a2==5)))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L443]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((a2==3) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 2))))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L449]   COND FALSE  !(((((a2==3) && ((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 2))) &&  a0 <=  -147 ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L455]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5)) && (a2==5)) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L459]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-147 < a0) && (-98 >= a0)) )) && (a2==4)))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L466]   COND FALSE  !(((((((a2==5) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==4)) || ((a2==5) &&  a29 <=  -144 ))) && (input == 2)) &&  a4 <=  -86 ) &&  -61 < a0 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L472]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((  ((-98 < a0) && (-61 >= a0))  && (input == 6)) && (a2==2))) &&  a29 <=  -144 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L478]   COND FALSE  !((  ((-16 < a29) && (43 >= a29))  && ( a4 <=  -86  && (((input == 6) &&  -61 < a0 ) && (a2==5)))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L484]   COND FALSE  !(((  ((-16 < a29) && (43 >= a29))  && (((input == 4) &&  -61 < a0 ) &&  a4 <=  -86 )) && (a2==5)))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L489]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((input == 5) && (((  ((-16 < a29) && (43 >= a29))  && (a2==2)) || ((a2==2) &&  43 < a29 )) || ( a29 <=  -144  && (a2==3)))))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L496]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && (((input == 1) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )) &&   ((-86 < a4) && (-42 >= a4)) )) && (a2==2)))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L501]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-98 < a0) && (-61 >= a0))  && (((input == 6) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )) && (a2==2)))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L507]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-147 < a0) && (-98 >= a0))  && ((input == 3) && (((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ( 43 < a29  && (a2==1))) || ((a2==2) &&  a29 <=  -144 ))))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L512]   COND FALSE  !(((( a0 <=  -147  && ((input == 2) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) && (a2==4)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L517]   COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && ((input == 4) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==1)))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L524]   COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && ( a29 <=  -144  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 3) && (a2==5))))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L530]   COND FALSE  !(((a2==4) && (  ((-86 < a4) && (-42 >= a4))  && (((input == 5) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&  a0 <=  -147 ))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L539]   COND FALSE  !((((a2==5) && (  ((-98 < a0) && (-61 >= a0))  && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 2)))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L552]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==1) && ( a0 <=  -147  && (  ((-16 < a29) && (43 >= a29))  && (input == 5))))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L556]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ( a0 <=  -147  && (((  ((-144 < a29) && (-16 >= a29))  && (a2==2)) || (((a2==1) &&  43 < a29 ) || ( a29 <=  -144  && (a2==2)))) && (input == 4)))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L567]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==2) && (((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 2)) &&   ((-98 < a0) && (-61 >= a0)) ))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L579]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && ((a2==5) && ( 43 < a29  && (input == 3))))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L584]   COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && (((a2==3) && (input == 4)) &&  43 < a29 ))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L597]   COND FALSE  !(((  ((-147 < a0) && (-98 >= a0))  && ((((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ((a2==1) &&  43 < a29 )) || ((a2==2) &&  a29 <=  -144 )) && (input == 6))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L604]   COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) && (a2==3)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L616]   COND FALSE  !((((a2==2) && ((  ((-144 < a29) && (-16 >= a29))  && (input == 1)) &&   ((-86 < a4) && (-42 >= a4)) )) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L623]   COND FALSE  !(( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 6) && (((a2==4) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==3)) || ((a2==4) &&  a29 <=  -144 )))))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L630]   COND FALSE  !(((((a2==1) && ((input == 5) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L637]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 4) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )))) && (a2==2)))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L644]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==5) && (( a0 <=  -147  && (input == 2)) &&  43 < a29 ))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L651]   COND FALSE  !(((a2==1) && (  ((-86 < a4) && (-42 >= a4))  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 3)) &&  a0 <=  -147 ))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L662]   COND FALSE  !(((((a2==1) && ((input == 6) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L667]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (((a2==1) && ((input == 2) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-147 < a0) && (-98 >= a0)) )))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L672]   COND FALSE  !(( a0 <=  -147  && ((a2==2) && (  ((-86 < a4) && (-42 >= a4))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 2))))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L678]   COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && ((((( 43 < a29  && (a2==2)) || ((a2==3) &&  a29 <=  -144 )) || ((a2==3) &&   ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L685]   COND FALSE  !(((((a2==5) && ((input == 4) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L691]   COND FALSE  !(((a2==2) && (  ((-98 < a0) && (-61 >= a0))  && (( a29 <=  -144  && (input == 1)) &&   ((-86 < a4) && (-42 >= a4)) ))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L697]   COND FALSE  !(((( a4 <=  -86  && ( -61 < a0  && (input == 5))) && (a2==5)) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L703]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 6)) && (a2==4)) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L717]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==5) && (  ((-98 < a0) && (-61 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 4))))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L722]   COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && ((input == 4) &&   ((-98 < a0) && (-61 >= a0)) )) &&  a29 <=  -144 ) && (a2==2)))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L728]   COND FALSE  !(((a2==1) && ((((input == 1) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) &&  a0 <=  -147 ) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L735]   COND FALSE  !(( a4 <=  -86  && ( -61 < a0  && (((((a2==4) &&  43 < a29 ) || ((a2==5) &&  a29 <=  -144 )) || (  ((-144 < a29) && (-16 >= a29))  && (a2==5))) && (input == 3)))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L742]   COND FALSE  !((((a2==5) && (((input == 5) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) ||  43 < a29 )) &&   ((-147 < a0) && (-98 >= a0)) )) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L745]   COND FALSE  !((((  ((-16 < a29) && (43 >= a29))  && ((input == 1) &&   ((-147 < a0) && (-98 >= a0)) )) && (a2==2)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L752]   COND FALSE  !((( a4 <=  -86  && ((input == 6) && ((((a2==2) &&   ((-16 < a29) && (43 >= a29)) ) || ((a2==2) &&  43 < a29 )) || ((a2==3) &&  a29 <=  -144 )))) &&  -61 < a0 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L758]   COND FALSE  !(((( -61 < a0  && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 5))) &&  a4 <=  -86 ) && (a2==3)))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L764]   COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && (  ((-86 < a4) && (-42 >= a4))  && ((((a2==3) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==2)) || ((a2==3) &&  a29 <=  -144 ))) && (input == 5)))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L771]   COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((((input == 6) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==1)) &&  43 < a29 )))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L778]   COND FALSE  !(( a0 <=  -147  && ((((input == 6) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) && (a2==4)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L784]   COND FALSE  !(((((a2==1) && ((input == 2) && (  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L789]   COND FALSE  !(((  ((-98 < a0) && (-61 >= a0))  && ((a2==4) && ((input == 4) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L796]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 4) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) )) &&  a0 <=  -147 )) && (a2==3)))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L803]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((( a29 <=  -144  && (a2==2)) || ((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ((a2==1) &&  43 < a29 ))) && (input == 4))) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L814]   COND FALSE  !(( a0 <=  -147  && (  ((-86 < a4) && (-42 >= a4))  && ((input == 1) && ((  ((-144 < a29) && (-16 >= a29))  && (a2==4)) || (( 43 < a29  && (a2==3)) || ((a2==4) &&  a29 <=  -144 )))))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L821]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5)) && (a2==2))) &&  a0 <=  -147 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L827]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((a2==3) && (  ((-147 < a0) && (-98 >= a0))  && ((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 5))))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L834]   COND FALSE  !(((a2==5) && ((( a0 <=  -147  && (input == 5)) &&  43 < a29 ) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L839]   COND FALSE  !((  ((-16 < a29) && (43 >= a29))  && ((  ((-86 < a4) && (-42 >= a4))  && ((a2==1) && (input == 3))) &&  a0 <=  -147 )))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L850]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (  ((-147 < a0) && (-98 >= a0))  && ((a2==4) && ((input == 4) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L855]   COND FALSE  !((( a4 <=  -86  && ((input == 3) && ((((a2==1) &&  43 < a29 ) || ( a29 <=  -144  && (a2==2))) || ((a2==2) &&   ((-144 < a29) && (-16 >= a29)) )))) &&  -61 < a0 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L861]   COND FALSE  !(((a2==4) && ((((input == 6) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L865]   COND FALSE  !(((a2==5) && ((((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 3)) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 )))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L872]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ((((a2==3) &&   ((-144 < a29) && (-16 >= a29)) ) || (((a2==2) &&  43 < a29 ) || ( a29 <=  -144  && (a2==3)))) && (input == 1))) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L878]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) &&  a0 <=  -147 ) && (a2==5))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L884]   COND FALSE  !(( a4 <=  -86  && ( -61 < a0  && ((input == 5) && ((( 43 < a29  && (a2==4)) || ( a29 <=  -144  && (a2==5))) || ((a2==5) &&   ((-144 < a29) && (-16 >= a29)) ))))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L890]   COND FALSE  !(((a2==3) && ( a4 <=  -86  && (((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 1)) &&  -61 < a0 ))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L895]   COND FALSE  !(((a2==5) && ((((input == 1) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-98 < a0) && (-61 >= a0)) )))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L905]   COND FALSE  !((((( -61 < a0  && (input == 2)) &&  43 < a29 ) &&  a4 <=  -86 ) && (a2==5)))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L911]   COND FALSE  !((((((input == 1) && (a2==1)) &&  43 < a29 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L917]   COND FALSE  !(((((a2==2) && ((input == 4) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L922]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 6) &&  43 < a29 ) && (a2==2))) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L929]   COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && ((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 3)) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==3))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L935]   COND FALSE  !(((  ((-147 < a0) && (-98 >= a0))  && (((input == 1) && (a2==5)) &&   ((-86 < a4) && (-42 >= a4)) )) &&  a29 <=  -144 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L940]   COND FALSE  !((((a2==1) && ( a0 <=  -147  && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 6)))) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L945]   COND FALSE  !(((((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) && (input == 2)) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==4)))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L952]   COND FALSE  !((((a2==1) && (((input == 5) &&   ((-86 < a4) && (-42 >= a4)) ) &&  43 < a29 )) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L958]   COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (  ((-98 < a0) && (-61 >= a0))  && ((input == 5) && (a2==2)))) &&  a29 <=  -144 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L965]   COND FALSE  !((( -61 < a0  && ((a2==1) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 3)))) &&  a4 <=  -86 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L969]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((((a2==1) &&   ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29  && (a2==1))) || ((a2==2) &&  a29 <=  -144 )) && (input == 5)) &&   ((-147 < a0) && (-98 >= a0)) )))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L976]   COND FALSE  !(((((  ((-147 < a0) && (-98 >= a0))  && (input == 4)) &&   ((-16 < a29) && (43 >= a29)) ) && (a2==2)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L983]   COND FALSE  !(( a4 <=  -86  && ((( 43 < a29  && (input == 5)) &&  -61 < a0 ) && (a2==3))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L989]   COND FALSE  !((((a2==4) && ( a4 <=  -86  && ((input == 3) && (( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) )))) &&  -61 < a0 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L995]   COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ((((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 6)) &&   ((-98 < a0) && (-61 >= a0)) ) && (a2==1))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1002]  COND FALSE  !((((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 6)) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==2)) &&  a0 <=  -147 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1008]  COND FALSE  !(( -61 < a0  && ( a4 <=  -86  && (((  ((-16 < a29) && (43 >= a29))  || ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (input == 2)) && (a2==4)))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1014]  COND FALSE  !((((((input == 1) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) ||  43 < a29 )) &&   ((-147 < a0) && (-98 >= a0)) ) && (a2==5)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1021]  COND FALSE  !((((  ((-98 < a0) && (-61 >= a0))  && ((input == 2) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) && (a2==3)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1026]  COND FALSE  !((((a2==4) && (  ((-86 < a4) && (-42 >= a4))  && ((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )))) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1029]  COND FALSE  !((((a2==2) && ((  ((-147 < a0) && (-98 >= a0))  && (input == 4)) &&   ((-86 < a4) && (-42 >= a4)) )) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1036]  COND FALSE  !(((a2==5) && (  ((-86 < a4) && (-42 >= a4))  && ((  ((-147 < a0) && (-98 >= a0))  && (input == 4)) &&  a29 <=  -144 ))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1040]  COND FALSE  !(( a4 <=  -86  && ((((((a2==2) &&   ((-16 < a29) && (43 >= a29)) ) || ( 43 < a29  && (a2==2))) || ((a2==3) &&  a29 <=  -144 )) && (input == 3)) &&  -61 < a0 )))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1045]  COND FALSE  !(((a2==2) && (  ((-86 < a4) && (-42 >= a4))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 1)) &&  a0 <=  -147 ))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1048]  COND FALSE  !(( a0 <=  -147  && ((((((a2==3) &&  43 < a29 ) || ( a29 <=  -144  && (a2==4))) || ((a2==4) &&   ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1054]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && (( a0 <=  -147  && ((a2==5) && (input == 1))) &&  43 < a29 )))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1059]  COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 3)) &&   ((-98 < a0) && (-61 >= a0)) )) && (a2==5)))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1072]  COND FALSE  !((((a2==2) && (((input == 4) &&   ((-86 < a4) && (-42 >= a4)) ) &&  43 < a29 )) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1084]  COND FALSE  !(((((((  ((-16 < a29) && (43 >= a29))  && (a2==1)) || ( 43 < a29  && (a2==1))) || ((a2==2) &&  a29 <=  -144 )) && (input == 2)) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-147 < a0) && (-98 >= a0)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1091]  COND FALSE  !(( a4 <=  -86  && (((input == 6) && ((( 43 < a29  && (a2==1)) || ( a29 <=  -144  && (a2==2))) || ((a2==2) &&   ((-144 < a29) && (-16 >= a29)) ))) &&  -61 < a0 )))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1096]  COND FALSE  !(((a2==1) && (( 43 < a29  && ((input == 2) &&   ((-98 < a0) && (-61 >= a0)) )) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1101]  COND FALSE  !((((((input == 4) && (  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) )) &&  a4 <=  -86 ) && (a2==3)) &&  -61 < a0 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1108]  COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && (((input == 2) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) && (a2==4))) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1118]  COND FALSE  !(((a2==2) && ((((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) && (input == 3)) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1125]  COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((((input == 2) && ( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) )) && (a2==4)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1132]  COND FALSE  !((  ((-147 < a0) && (-98 >= a0))  && (  ((-86 < a4) && (-42 >= a4))  && (((input == 2) && ((  ((-144 < a29) && (-16 >= a29))  ||   ((-16 < a29) && (43 >= a29)) ) ||  43 < a29 )) && (a2==5)))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1138]  COND FALSE  !(( 43 < a29  && ( a4 <=  -86  && ( -61 < a0  && ((a2==3) && (input == 3))))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1144]  COND FALSE  !((((((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-147 < a0) && (-98 >= a0)) ) && (a2==3)))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1155]  COND FALSE  !((  ((-86 < a4) && (-42 >= a4))  && ( a0 <=  -147  && (((  ((-144 < a29) && (-16 >= a29))  && (a2==2)) || (( 43 < a29  && (a2==1)) || ((a2==2) &&  a29 <=  -144 ))) && (input == 1)))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1160]  COND FALSE  !(((a2==4) && ((((input == 3) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1166]  COND FALSE  !(((a2==4) && ((((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 1)) &&  a4 <=  -86 ) &&  -61 < a0 )))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1172]  COND FALSE  !((((a2==4) && (((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 4)) &&   ((-98 < a0) && (-61 >= a0)) )) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1178]  COND FALSE  !(((  ((-86 < a4) && (-42 >= a4))  && ( 43 < a29  && ((input == 3) && (a2==1)))) &&   ((-98 < a0) && (-61 >= a0)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1182]  COND FALSE  !((  ((-98 < a0) && (-61 >= a0))  && ((a2==1) && (  ((-86 < a4) && (-42 >= a4))  && ((( a29 <=  -144  ||   ((-144 < a29) && (-16 >= a29)) ) ||   ((-16 < a29) && (43 >= a29)) ) && (input == 3))))))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1188]  COND FALSE  !(( a0 <=  -147  && (((((a2==2) &&   ((-144 < a29) && (-16 >= a29)) ) || (( 43 < a29  && (a2==1)) || ( a29 <=  -144  && (a2==2)))) && (input == 2)) &&   ((-86 < a4) && (-42 >= a4)) )))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1194]  COND FALSE  !((((  ((-86 < a4) && (-42 >= a4))  && ((input == 2) && (a2==2))) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1200]  COND FALSE  !(((((  ((-98 < a0) && (-61 >= a0))  && (input == 2)) &&  a29 <=  -144 ) && (a2==2)) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1207]  COND FALSE  !((((a2==5) && ( -61 < a0  && ((input == 5) &&  43 < a29 ))) &&  a4 <=  -86 ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1213]  COND FALSE  !((((( a0 <=  -147  && (input == 6)) && (a2==5)) &&  43 < a29 ) &&   ((-86 < a4) && (-42 >= a4)) ))
         VAL         [a0=-300118, a29=38773, a2=5, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1218]  COND TRUE   ( 43 < a29  && ((((input == 4) &&  a0 <=  -147 ) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==5)))
[L1219]              a4 = ((((a4 * 21)/ 10) * 5) - 593094)
[L1220]              a0 = ((((((a0 % 24)- 122) + -1) * 5) % 24)+ -109)
[L1221]              return -1;
         VAL         [\result=-1, a0=-114, a29=38773, a2=5, a4=-593699, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1784]  RET, EXPR   calculate_output(input)
[L1784]              output = calculate_output(input)
[L1776]  COND TRUE   1
[L1779]              int input;
[L1780]              input = __VERIFIER_nondet_int()
[L1781]  COND FALSE  !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L1784]  CALL        calculate_output(input)
[L34]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-114, a29=38773, a2=5, a4=-593699, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L37]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-114, a29=38773, a2=5, a4=-593699, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L40]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-114, a29=38773, a2=5, a4=-593699, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L43]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-114, a29=38773, a2=5, a4=-593699, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L46]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-114, a29=38773, a2=5, a4=-593699, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L49]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-114, a29=38773, a2=5, a4=-593699, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L52]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-114, a29=38773, a2=5, a4=-593699, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L55]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-114, a29=38773, a2=5, a4=-593699, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L58]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-114, a29=38773, a2=5, a4=-593699, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L61]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-114, a29=38773, a2=5, a4=-593699, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L64]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-114, a29=38773, a2=5, a4=-593699, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L67]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  a29 <=  -144 ))
         VAL         [a0=-114, a29=38773, a2=5, a4=-593699, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L70]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 ))
         VAL         [a0=-114, a29=38773, a2=5, a4=-593699, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L73]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-114, a29=38773, a2=5, a4=-593699, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L76]    COND FALSE  !(((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-114, a29=38773, a2=5, a4=-593699, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L79]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-114, a29=38773, a2=5, a4=-593699, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L82]    COND FALSE  !(((((a2==4) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-114, a29=38773, a2=5, a4=-593699, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L85]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  a29 <=  -144 ))
         VAL         [a0=-114, a29=38773, a2=5, a4=-593699, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L88]    COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-114, a29=38773, a2=5, a4=-593699, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L91]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-114, a29=38773, a2=5, a4=-593699, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L94]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-114, a29=38773, a2=5, a4=-593699, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L97]    COND FALSE  !(((((a2==3) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-114, a29=38773, a2=5, a4=-593699, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L100]   COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 ))
         VAL         [a0=-114, a29=38773, a2=5, a4=-593699, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L103]   COND FALSE  !(((((a2==2) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) ))
         VAL         [a0=-114, a29=38773, a2=5, a4=-593699, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L106]   COND TRUE   ((((a2==5) &&  a4 <=  -86 ) &&   ((-147 < a0) && (-98 >= a0)) ) &&  43 < a29 )
         VAL         [a0=-114, a29=38773, a2=5, a4=-593699, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L107]               reach_error()
         VAL         [a0=-114, a29=38773, a2=5, a4=-593699, input=6, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 424 locations, 749 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.4s, OverallIterations: 23, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 27.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8791 SdHoareTripleChecker+Valid, 25.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8791 mSDsluCounter, 9169 SdHoareTripleChecker+Invalid, 21.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1117 mSDsCounter, 4228 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29479 IncrementalHoareTripleChecker+Invalid, 33707 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4228 mSolverCounterUnsat, 8052 mSDtfsCounter, 29479 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4163 GetRequests, 4109 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19222occurred in iteration=22, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 29404 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 14790 NumberOfCodeBlocks, 14790 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 15344 ConstructedInterpolants, 0 QuantifiedInterpolants, 62456 SizeOfPredicates, 12 NumberOfNonLiveVariables, 3159 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 28 InterpolantComputations, 20 PerfectInterpolantSequences, 15902/16904 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2025-03-08 02:02:32,490 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE