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


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


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

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


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 970a84593c0bec11fea8b95335966215ba468481b559446652c2d60f98ba63c5
[2025-02-05 11:52:24,389 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 11:52:24,397 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 11:52:24,399 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 11:52:24,400 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 11:52:24,400 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 11:52:24,401 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label14.c
[2025-02-05 11:52:25,578 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f128db528/8e020574a3c04335911704fa568d0030/FLAG77642f1a1
[2025-02-05 11:52:26,053 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 11:52:26,054 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label14.c
[2025-02-05 11:52:26,070 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f128db528/8e020574a3c04335911704fa568d0030/FLAG77642f1a1
[2025-02-05 11:52:26,161 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f128db528/8e020574a3c04335911704fa568d0030
[2025-02-05 11:52:26,163 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 11:52:26,164 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 11:52:26,165 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 11:52:26,166 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 11:52:26,168 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 11:52:26,169 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:52:26" (1/1) ...
[2025-02-05 11:52:26,169 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7700366f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:26, skipping insertion in model container
[2025-02-05 11:52:26,170 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:52:26" (1/1) ...
[2025-02-05 11:52:26,201 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 11:52:26,315 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label14.c[2008,2021]
[2025-02-05 11:52:26,630 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:52:26,637 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 11:52:26,650 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label14.c[2008,2021]
[2025-02-05 11:52:26,821 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:52:26,833 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 11:52:26,835 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:26 WrapperNode
[2025-02-05 11:52:26,835 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 11:52:26,836 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 11:52:26,836 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 11:52:26,836 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 11:52:26,840 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:26" (1/1) ...
[2025-02-05 11:52:26,863 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:26" (1/1) ...
[2025-02-05 11:52:26,981 INFO  L138                Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757
[2025-02-05 11:52:26,981 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 11:52:26,982 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 11:52:26,982 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 11:52:26,982 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 11:52:26,988 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:26" (1/1) ...
[2025-02-05 11:52:26,988 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:26" (1/1) ...
[2025-02-05 11:52:27,014 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:26" (1/1) ...
[2025-02-05 11:52:27,118 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-05 11:52:27,119 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:26" (1/1) ...
[2025-02-05 11:52:27,119 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:26" (1/1) ...
[2025-02-05 11:52:27,166 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:26" (1/1) ...
[2025-02-05 11:52:27,173 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:26" (1/1) ...
[2025-02-05 11:52:27,182 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:26" (1/1) ...
[2025-02-05 11:52:27,191 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:26" (1/1) ...
[2025-02-05 11:52:27,240 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 11:52:27,241 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 11:52:27,241 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 11:52:27,241 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 11:52:27,243 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:26" (1/1) ...
[2025-02-05 11:52:27,246 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 11:52:27,254 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:52:27,271 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-05 11:52:27,278 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-05 11:52:27,292 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 11:52:27,292 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 11:52:27,292 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 11:52:27,292 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 11:52:27,343 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 11:52:27,345 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 11:52:29,594 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1;
[2025-02-05 11:52:29,678 INFO  L?                        ?]: Removed 246 outVars from TransFormulas that were not future-live.
[2025-02-05 11:52:29,678 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 11:52:29,695 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 11:52:29,695 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 11:52:29,696 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:52:29 BoogieIcfgContainer
[2025-02-05 11:52:29,696 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 11:52:29,701 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 11:52:29,701 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 11:52:29,705 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 11:52:29,705 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:52:26" (1/3) ...
[2025-02-05 11:52:29,706 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5464b1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:52:29, skipping insertion in model container
[2025-02-05 11:52:29,706 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:52:26" (2/3) ...
[2025-02-05 11:52:29,706 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5464b1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:52:29, skipping insertion in model container
[2025-02-05 11:52:29,706 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:52:29" (3/3) ...
[2025-02-05 11:52:29,707 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem15_label14.c
[2025-02-05 11:52:29,720 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 11:52:29,722 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label14.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 11:52:29,773 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 11:52:29,783 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;@30c0ff4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 11:52:29,783 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 11:52:29,788 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-02-05 11:52:29,792 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2025-02-05 11:52:29,792 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:52:29,793 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:52:29,793 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:52:29,797 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:52:29,798 INFO  L85        PathProgramCache]: Analyzing trace with hash -395821174, now seen corresponding path program 1 times
[2025-02-05 11:52:29,804 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:52:29,805 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960744326]
[2025-02-05 11:52:29,805 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:29,805 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:52:29,865 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes.
[2025-02-05 11:52:29,882 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements.
[2025-02-05 11:52:29,883 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:29,883 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:29,967 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:52:29,968 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:52:29,968 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960744326]
[2025-02-05 11:52:29,969 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960744326] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:52:29,969 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:52:29,969 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:52:29,970 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346538641]
[2025-02-05 11:52:29,971 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:52:29,974 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:52:29,974 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:52:29,989 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:52:29,990 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:29,992 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 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:31,927 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:52:31,927 INFO  L93              Difference]: Finished difference Result 1191 states and 2154 transitions.
[2025-02-05 11:52:31,928 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:52:31,929 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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 15
[2025-02-05 11:52:31,929 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:52:31,940 INFO  L225             Difference]: With dead ends: 1191
[2025-02-05 11:52:31,940 INFO  L226             Difference]: Without dead ends: 688
[2025-02-05 11:52:31,946 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:31,948 INFO  L435           NwaCegarLoop]: 188 mSDtfsCounter, 356 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-02-05 11:52:31,948 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 229 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-02-05 11:52:31,970 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 688 states.
[2025-02-05 11:52:32,027 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 680.
[2025-02-05 11:52:32,032 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 680 states, 679 states have (on average 1.609720176730486) internal successors, (1093), 679 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:32,040 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1093 transitions.
[2025-02-05 11:52:32,042 INFO  L78                 Accepts]: Start accepts. Automaton has 680 states and 1093 transitions. Word has length 15
[2025-02-05 11:52:32,043 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:52:32,043 INFO  L471      AbstractCegarLoop]: Abstraction has 680 states and 1093 transitions.
[2025-02-05 11:52:32,043 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:32,043 INFO  L276                IsEmpty]: Start isEmpty. Operand 680 states and 1093 transitions.
[2025-02-05 11:52:32,045 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2025-02-05 11:52:32,046 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:52:32,046 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-02-05 11:52:32,047 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 11:52:32,047 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:52:32,048 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:52:32,048 INFO  L85        PathProgramCache]: Analyzing trace with hash 139718091, now seen corresponding path program 1 times
[2025-02-05 11:52:32,048 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:52:32,048 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820911177]
[2025-02-05 11:52:32,049 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:32,049 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:52:32,066 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes.
[2025-02-05 11:52:32,100 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements.
[2025-02-05 11:52:32,100 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:32,100 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:32,259 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:52:32,259 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:52:32,259 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820911177]
[2025-02-05 11:52:32,259 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820911177] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:52:32,259 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:52:32,259 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:52:32,259 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929963483]
[2025-02-05 11:52:32,259 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:52:32,261 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:52:32,261 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:52:32,261 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:52:32,261 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:32,261 INFO  L87              Difference]: Start difference. First operand 680 states and 1093 transitions. Second operand  has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:33,627 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:52:33,627 INFO  L93              Difference]: Finished difference Result 1964 states and 3171 transitions.
[2025-02-05 11:52:33,627 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:52:33,628 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 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 83
[2025-02-05 11:52:33,628 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:52:33,646 INFO  L225             Difference]: With dead ends: 1964
[2025-02-05 11:52:33,646 INFO  L226             Difference]: Without dead ends: 1286
[2025-02-05 11:52:33,649 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:33,650 INFO  L435           NwaCegarLoop]: 294 mSDtfsCounter, 282 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-02-05 11:52:33,650 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 361 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-02-05 11:52:33,654 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1286 states.
[2025-02-05 11:52:33,694 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1281.
[2025-02-05 11:52:33,701 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1281 states, 1280 states have (on average 1.3953125) internal successors, (1786), 1280 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:33,708 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1786 transitions.
[2025-02-05 11:52:33,708 INFO  L78                 Accepts]: Start accepts. Automaton has 1281 states and 1786 transitions. Word has length 83
[2025-02-05 11:52:33,709 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:52:33,709 INFO  L471      AbstractCegarLoop]: Abstraction has 1281 states and 1786 transitions.
[2025-02-05 11:52:33,709 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:33,709 INFO  L276                IsEmpty]: Start isEmpty. Operand 1281 states and 1786 transitions.
[2025-02-05 11:52:33,711 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-02-05 11:52:33,712 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:52:33,713 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-02-05 11:52:33,713 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 11:52:33,713 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:52:33,713 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:52:33,714 INFO  L85        PathProgramCache]: Analyzing trace with hash -1994029601, now seen corresponding path program 1 times
[2025-02-05 11:52:33,714 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:52:33,714 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191166049]
[2025-02-05 11:52:33,714 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:33,715 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:52:33,730 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-02-05 11:52:33,758 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-02-05 11:52:33,758 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:33,758 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:34,072 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:52:34,074 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:52:34,074 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191166049]
[2025-02-05 11:52:34,074 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191166049] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:52:34,074 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:52:34,075 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:52:34,075 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904738084]
[2025-02-05 11:52:34,075 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:52:34,075 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:52:34,075 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:52:34,076 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:52:34,077 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:34,078 INFO  L87              Difference]: Start difference. First operand 1281 states and 1786 transitions. Second operand  has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:35,698 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:52:35,698 INFO  L93              Difference]: Finished difference Result 2859 states and 3905 transitions.
[2025-02-05 11:52:35,702 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:52:35,703 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 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 91
[2025-02-05 11:52:35,703 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:52:35,709 INFO  L225             Difference]: With dead ends: 2859
[2025-02-05 11:52:35,710 INFO  L226             Difference]: Without dead ends: 1580
[2025-02-05 11:52:35,715 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:35,717 INFO  L435           NwaCegarLoop]: 324 mSDtfsCounter, 225 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:52:35,717 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 359 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-02-05 11:52:35,721 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1580 states.
[2025-02-05 11:52:35,754 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1580.
[2025-02-05 11:52:35,756 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1580 states, 1579 states have (on average 1.3242558581380621) internal successors, (2091), 1579 states have internal predecessors, (2091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:35,762 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2091 transitions.
[2025-02-05 11:52:35,762 INFO  L78                 Accepts]: Start accepts. Automaton has 1580 states and 2091 transitions. Word has length 91
[2025-02-05 11:52:35,762 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:52:35,762 INFO  L471      AbstractCegarLoop]: Abstraction has 1580 states and 2091 transitions.
[2025-02-05 11:52:35,763 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:35,763 INFO  L276                IsEmpty]: Start isEmpty. Operand 1580 states and 2091 transitions.
[2025-02-05 11:52:35,767 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 183
[2025-02-05 11:52:35,767 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:52:35,768 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:52:35,768 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 11:52:35,768 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:52:35,769 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:52:35,769 INFO  L85        PathProgramCache]: Analyzing trace with hash -971205435, now seen corresponding path program 1 times
[2025-02-05 11:52:35,769 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:52:35,770 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67158626]
[2025-02-05 11:52:35,770 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:35,770 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:52:35,811 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes.
[2025-02-05 11:52:35,840 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements.
[2025-02-05 11:52:35,840 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:35,840 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:36,365 INFO  L134       CoverageAnalysis]: Checked inductivity of 100 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:52:36,365 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:52:36,366 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67158626]
[2025-02-05 11:52:36,366 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67158626] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:52:36,366 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383373610]
[2025-02-05 11:52:36,366 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:36,366 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:52:36,366 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:52:36,369 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:52:36,370 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-05 11:52:36,411 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes.
[2025-02-05 11:52:36,443 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements.
[2025-02-05 11:52:36,443 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:36,443 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:36,445 INFO  L256         TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-02-05 11:52:36,450 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:52:36,978 INFO  L134       CoverageAnalysis]: Checked inductivity of 100 backedges. 76 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:52:36,981 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 11:52:37,457 INFO  L134       CoverageAnalysis]: Checked inductivity of 100 backedges. 76 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:52:37,458 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [383373610] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-05 11:52:37,458 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-05 11:52:37,458 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9
[2025-02-05 11:52:37,458 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58990406]
[2025-02-05 11:52:37,458 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-05 11:52:37,459 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-02-05 11:52:37,459 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:52:37,459 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-02-05 11:52:37,459 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2025-02-05 11:52:37,460 INFO  L87              Difference]: Start difference. First operand 1580 states and 2091 transitions. Second operand  has 10 states, 10 states have (on average 49.4) internal successors, (494), 9 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-02-05 11:52:42,984 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:52:42,984 INFO  L93              Difference]: Finished difference Result 8167 states and 11084 transitions.
[2025-02-05 11:52:42,984 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-02-05 11:52:42,985 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 49.4) internal successors, (494), 9 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 182
[2025-02-05 11:52:42,985 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:52:43,007 INFO  L225             Difference]: With dead ends: 8167
[2025-02-05 11:52:43,007 INFO  L226             Difference]: Without dead ends: 4287
[2025-02-05 11:52:43,011 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272
[2025-02-05 11:52:43,015 INFO  L435           NwaCegarLoop]: 109 mSDtfsCounter, 4027 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 7111 mSolverCounterSat, 1207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4027 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 8318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1207 IncrementalHoareTripleChecker+Valid, 7111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time
[2025-02-05 11:52:43,015 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4027 Valid, 324 Invalid, 8318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1207 Valid, 7111 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time]
[2025-02-05 11:52:43,018 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4287 states.
[2025-02-05 11:52:43,095 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4287 to 3978.
[2025-02-05 11:52:43,105 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3978 states, 3977 states have (on average 1.1508674880563239) internal successors, (4577), 3977 states have internal predecessors, (4577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:43,122 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 4577 transitions.
[2025-02-05 11:52:43,123 INFO  L78                 Accepts]: Start accepts. Automaton has 3978 states and 4577 transitions. Word has length 182
[2025-02-05 11:52:43,123 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:52:43,123 INFO  L471      AbstractCegarLoop]: Abstraction has 3978 states and 4577 transitions.
[2025-02-05 11:52:43,123 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 49.4) internal successors, (494), 9 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-02-05 11:52:43,123 INFO  L276                IsEmpty]: Start isEmpty. Operand 3978 states and 4577 transitions.
[2025-02-05 11:52:43,127 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 298
[2025-02-05 11:52:43,131 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:52:43,132 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:52:43,142 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-02-05 11:52:43,332 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:52:43,332 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:52:43,333 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:52:43,333 INFO  L85        PathProgramCache]: Analyzing trace with hash 809702594, now seen corresponding path program 1 times
[2025-02-05 11:52:43,333 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:52:43,333 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130406365]
[2025-02-05 11:52:43,333 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:43,334 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:52:43,396 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes.
[2025-02-05 11:52:43,414 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements.
[2025-02-05 11:52:43,414 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:43,414 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:43,584 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 11:52:43,584 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:52:43,584 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130406365]
[2025-02-05 11:52:43,584 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130406365] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:52:43,584 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:52:43,584 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:52:43,584 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009806209]
[2025-02-05 11:52:43,584 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:52:43,585 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:52:43,585 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:52:43,585 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:52:43,585 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:43,586 INFO  L87              Difference]: Start difference. First operand 3978 states and 4577 transitions. Second operand  has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:44,547 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:52:44,548 INFO  L93              Difference]: Finished difference Result 9461 states and 11065 transitions.
[2025-02-05 11:52:44,548 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:52:44,548 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 297
[2025-02-05 11:52:44,549 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:52:44,561 INFO  L225             Difference]: With dead ends: 9461
[2025-02-05 11:52:44,562 INFO  L226             Difference]: Without dead ends: 5485
[2025-02-05 11:52:44,569 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:44,570 INFO  L435           NwaCegarLoop]: 545 mSDtfsCounter, 305 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 11:52:44,574 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 584 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 11:52:44,582 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5485 states.
[2025-02-05 11:52:44,681 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5485 to 5482.
[2025-02-05 11:52:44,687 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5482 states, 5481 states have (on average 1.11421273490239) internal successors, (6107), 5481 states have internal predecessors, (6107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:44,696 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5482 states to 5482 states and 6107 transitions.
[2025-02-05 11:52:44,696 INFO  L78                 Accepts]: Start accepts. Automaton has 5482 states and 6107 transitions. Word has length 297
[2025-02-05 11:52:44,698 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:52:44,700 INFO  L471      AbstractCegarLoop]: Abstraction has 5482 states and 6107 transitions.
[2025-02-05 11:52:44,700 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:44,700 INFO  L276                IsEmpty]: Start isEmpty. Operand 5482 states and 6107 transitions.
[2025-02-05 11:52:44,703 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 363
[2025-02-05 11:52:44,703 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:52:44,704 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:52:44,704 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 11:52:44,704 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:52:44,705 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:52:44,706 INFO  L85        PathProgramCache]: Analyzing trace with hash -740564049, now seen corresponding path program 1 times
[2025-02-05 11:52:44,706 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:52:44,706 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801068332]
[2025-02-05 11:52:44,707 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:44,707 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:52:44,736 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes.
[2025-02-05 11:52:44,759 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements.
[2025-02-05 11:52:44,759 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:44,759 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:44,945 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked.
[2025-02-05 11:52:44,946 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:52:44,946 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801068332]
[2025-02-05 11:52:44,946 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801068332] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:52:44,946 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:52:44,946 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:52:44,946 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560874440]
[2025-02-05 11:52:44,946 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:52:44,947 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:52:44,947 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:52:44,947 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:52:44,947 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:44,947 INFO  L87              Difference]: Start difference. First operand 5482 states and 6107 transitions. Second operand  has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:46,215 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:52:46,216 INFO  L93              Difference]: Finished difference Result 11562 states and 13002 transitions.
[2025-02-05 11:52:46,216 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:52:46,217 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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 362
[2025-02-05 11:52:46,217 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:52:46,229 INFO  L225             Difference]: With dead ends: 11562
[2025-02-05 11:52:46,229 INFO  L226             Difference]: Without dead ends: 6082
[2025-02-05 11:52:46,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-02-05 11:52:46,234 INFO  L435           NwaCegarLoop]: 242 mSDtfsCounter, 296 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-02-05 11:52:46,235 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 280 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-02-05 11:52:46,239 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6082 states.
[2025-02-05 11:52:46,287 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6082 to 5781.
[2025-02-05 11:52:46,294 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5781 states, 5780 states have (on average 1.1110726643598616) internal successors, (6422), 5780 states have internal predecessors, (6422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:46,304 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5781 states to 5781 states and 6422 transitions.
[2025-02-05 11:52:46,304 INFO  L78                 Accepts]: Start accepts. Automaton has 5781 states and 6422 transitions. Word has length 362
[2025-02-05 11:52:46,305 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:52:46,305 INFO  L471      AbstractCegarLoop]: Abstraction has 5781 states and 6422 transitions.
[2025-02-05 11:52:46,305 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:46,305 INFO  L276                IsEmpty]: Start isEmpty. Operand 5781 states and 6422 transitions.
[2025-02-05 11:52:46,308 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 393
[2025-02-05 11:52:46,308 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:52:46,308 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:52:46,308 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 11:52:46,308 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:52:46,309 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:52:46,309 INFO  L85        PathProgramCache]: Analyzing trace with hash 798025541, now seen corresponding path program 1 times
[2025-02-05 11:52:46,309 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:52:46,309 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382654761]
[2025-02-05 11:52:46,309 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:46,309 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:52:46,339 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes.
[2025-02-05 11:52:46,358 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements.
[2025-02-05 11:52:46,358 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:46,358 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:46,577 INFO  L134       CoverageAnalysis]: Checked inductivity of 131 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked.
[2025-02-05 11:52:46,578 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:52:46,578 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382654761]
[2025-02-05 11:52:46,578 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382654761] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:52:46,578 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:52:46,578 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:52:46,578 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107398648]
[2025-02-05 11:52:46,578 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:52:46,578 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:52:46,578 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:52:46,580 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:52:46,580 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:46,581 INFO  L87              Difference]: Start difference. First operand 5781 states and 6422 transitions. Second operand  has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:47,669 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:52:47,670 INFO  L93              Difference]: Finished difference Result 13056 states and 14705 transitions.
[2025-02-05 11:52:47,670 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:52:47,670 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 392
[2025-02-05 11:52:47,671 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:52:47,685 INFO  L225             Difference]: With dead ends: 13056
[2025-02-05 11:52:47,685 INFO  L226             Difference]: Without dead ends: 7277
[2025-02-05 11:52:47,689 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:47,690 INFO  L435           NwaCegarLoop]: 509 mSDtfsCounter, 310 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-02-05 11:52:47,690 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 548 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-02-05 11:52:47,694 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7277 states.
[2025-02-05 11:52:47,762 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7277 to 7273.
[2025-02-05 11:52:47,769 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7273 states, 7272 states have (on average 1.0893839383938393) internal successors, (7922), 7272 states have internal predecessors, (7922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:47,778 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7273 states to 7273 states and 7922 transitions.
[2025-02-05 11:52:47,778 INFO  L78                 Accepts]: Start accepts. Automaton has 7273 states and 7922 transitions. Word has length 392
[2025-02-05 11:52:47,778 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:52:47,779 INFO  L471      AbstractCegarLoop]: Abstraction has 7273 states and 7922 transitions.
[2025-02-05 11:52:47,779 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:47,779 INFO  L276                IsEmpty]: Start isEmpty. Operand 7273 states and 7922 transitions.
[2025-02-05 11:52:47,782 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 475
[2025-02-05 11:52:47,782 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:52:47,783 INFO  L218           NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-02-05 11:52:47,783 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 11:52:47,783 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:52:47,783 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:52:47,783 INFO  L85        PathProgramCache]: Analyzing trace with hash -1360815668, now seen corresponding path program 1 times
[2025-02-05 11:52:47,783 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:52:47,783 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764874362]
[2025-02-05 11:52:47,784 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:47,784 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:52:47,813 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes.
[2025-02-05 11:52:47,832 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements.
[2025-02-05 11:52:47,833 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:47,833 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:48,087 INFO  L134       CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked.
[2025-02-05 11:52:48,088 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:52:48,088 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764874362]
[2025-02-05 11:52:48,088 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764874362] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:52:48,088 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:52:48,088 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:52:48,088 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574633073]
[2025-02-05 11:52:48,089 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:52:48,089 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:52:48,089 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:52:48,089 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:52:48,090 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:48,090 INFO  L87              Difference]: Start difference. First operand 7273 states and 7922 transitions. Second operand  has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:48,944 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:52:48,946 INFO  L93              Difference]: Finished difference Result 16346 states and 17898 transitions.
[2025-02-05 11:52:48,947 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:52:48,947 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 474
[2025-02-05 11:52:48,949 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:52:48,975 INFO  L225             Difference]: With dead ends: 16346
[2025-02-05 11:52:48,975 INFO  L226             Difference]: Without dead ends: 9374
[2025-02-05 11:52:48,980 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:48,981 INFO  L435           NwaCegarLoop]: 189 mSDtfsCounter, 42 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:52:48,984 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 232 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 11:52:48,994 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9374 states.
[2025-02-05 11:52:49,078 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9374 to 9372.
[2025-02-05 11:52:49,090 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9372 states, 9371 states have (on average 1.078433464945043) internal successors, (10106), 9371 states have internal predecessors, (10106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:49,101 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9372 states to 9372 states and 10106 transitions.
[2025-02-05 11:52:49,101 INFO  L78                 Accepts]: Start accepts. Automaton has 9372 states and 10106 transitions. Word has length 474
[2025-02-05 11:52:49,102 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:52:49,102 INFO  L471      AbstractCegarLoop]: Abstraction has 9372 states and 10106 transitions.
[2025-02-05 11:52:49,102 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:49,102 INFO  L276                IsEmpty]: Start isEmpty. Operand 9372 states and 10106 transitions.
[2025-02-05 11:52:49,108 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 517
[2025-02-05 11:52:49,108 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:52:49,108 INFO  L218           NwaCegarLoop]: trace histogram [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, 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-02-05 11:52:49,109 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 11:52:49,109 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:52:49,110 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:52:49,110 INFO  L85        PathProgramCache]: Analyzing trace with hash -1452529092, now seen corresponding path program 1 times
[2025-02-05 11:52:49,110 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:52:49,110 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310743500]
[2025-02-05 11:52:49,110 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:49,110 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:52:49,145 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 516 statements into 1 equivalence classes.
[2025-02-05 11:52:49,167 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 516 of 516 statements.
[2025-02-05 11:52:49,168 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:49,168 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:49,372 INFO  L134       CoverageAnalysis]: Checked inductivity of 372 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked.
[2025-02-05 11:52:49,372 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:52:49,372 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310743500]
[2025-02-05 11:52:49,372 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310743500] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:52:49,372 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:52:49,372 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:52:49,372 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641000011]
[2025-02-05 11:52:49,372 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:52:49,373 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:52:49,373 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:52:49,373 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:52:49,373 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:49,374 INFO  L87              Difference]: Start difference. First operand 9372 states and 10106 transitions. Second operand  has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:50,113 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:52:50,114 INFO  L93              Difference]: Finished difference Result 18740 states and 20236 transitions.
[2025-02-05 11:52:50,114 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:52:50,114 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 516
[2025-02-05 11:52:50,115 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:52:50,126 INFO  L225             Difference]: With dead ends: 18740
[2025-02-05 11:52:50,127 INFO  L226             Difference]: Without dead ends: 9669
[2025-02-05 11:52:50,132 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:50,133 INFO  L435           NwaCegarLoop]: 64 mSDtfsCounter, 437 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 11:52:50,133 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 69 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 11:52:50,139 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9669 states.
[2025-02-05 11:52:50,182 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9669 to 9370.
[2025-02-05 11:52:50,188 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9370 states, 9369 states have (on average 1.0782367381791014) internal successors, (10102), 9369 states have internal predecessors, (10102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:50,196 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9370 states to 9370 states and 10102 transitions.
[2025-02-05 11:52:50,196 INFO  L78                 Accepts]: Start accepts. Automaton has 9370 states and 10102 transitions. Word has length 516
[2025-02-05 11:52:50,196 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:52:50,197 INFO  L471      AbstractCegarLoop]: Abstraction has 9370 states and 10102 transitions.
[2025-02-05 11:52:50,197 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:50,197 INFO  L276                IsEmpty]: Start isEmpty. Operand 9370 states and 10102 transitions.
[2025-02-05 11:52:50,199 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 543
[2025-02-05 11:52:50,199 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:52:50,199 INFO  L218           NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-02-05 11:52:50,199 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 11:52:50,200 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:52:50,200 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:52:50,200 INFO  L85        PathProgramCache]: Analyzing trace with hash 1457014416, now seen corresponding path program 1 times
[2025-02-05 11:52:50,200 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:52:50,200 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923119332]
[2025-02-05 11:52:50,200 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:50,200 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:52:50,232 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes.
[2025-02-05 11:52:50,255 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements.
[2025-02-05 11:52:50,255 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:50,256 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:50,507 INFO  L134       CoverageAnalysis]: Checked inductivity of 400 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked.
[2025-02-05 11:52:50,507 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:52:50,507 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923119332]
[2025-02-05 11:52:50,508 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923119332] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:52:50,508 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:52:50,508 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:52:50,508 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631201774]
[2025-02-05 11:52:50,508 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:52:50,508 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:52:50,508 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:52:50,508 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:52:50,509 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:50,509 INFO  L87              Difference]: Start difference. First operand 9370 states and 10102 transitions. Second operand  has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:51,407 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:52:51,407 INFO  L93              Difference]: Finished difference Result 21758 states and 23489 transitions.
[2025-02-05 11:52:51,408 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:52:51,408 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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 542
[2025-02-05 11:52:51,409 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:52:51,424 INFO  L225             Difference]: With dead ends: 21758
[2025-02-05 11:52:51,425 INFO  L226             Difference]: Without dead ends: 12390
[2025-02-05 11:52:51,432 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:51,432 INFO  L435           NwaCegarLoop]: 213 mSDtfsCounter, 322 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:52:51,433 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 248 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 11:52:51,439 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12390 states.
[2025-02-05 11:52:51,494 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12390 to 9971.
[2025-02-05 11:52:51,501 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9971 states, 9970 states have (on average 1.0761283851554664) internal successors, (10729), 9970 states have internal predecessors, (10729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:51,561 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9971 states to 9971 states and 10729 transitions.
[2025-02-05 11:52:51,562 INFO  L78                 Accepts]: Start accepts. Automaton has 9971 states and 10729 transitions. Word has length 542
[2025-02-05 11:52:51,562 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:52:51,562 INFO  L471      AbstractCegarLoop]: Abstraction has 9971 states and 10729 transitions.
[2025-02-05 11:52:51,563 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:51,563 INFO  L276                IsEmpty]: Start isEmpty. Operand 9971 states and 10729 transitions.
[2025-02-05 11:52:51,566 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 551
[2025-02-05 11:52:51,566 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:52:51,566 INFO  L218           NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 11:52:51,566 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 11:52:51,566 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:52:51,567 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:52:51,567 INFO  L85        PathProgramCache]: Analyzing trace with hash -455705311, now seen corresponding path program 1 times
[2025-02-05 11:52:51,567 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:52:51,568 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604820625]
[2025-02-05 11:52:51,568 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:51,568 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:52:51,623 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 550 statements into 1 equivalence classes.
[2025-02-05 11:52:51,658 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 550 of 550 statements.
[2025-02-05 11:52:51,658 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:51,658 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:52,341 INFO  L134       CoverageAnalysis]: Checked inductivity of 377 backedges. 176 proven. 13 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked.
[2025-02-05 11:52:52,341 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:52:52,341 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604820625]
[2025-02-05 11:52:52,341 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604820625] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:52:52,341 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286180517]
[2025-02-05 11:52:52,341 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:52,341 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:52:52,341 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:52:52,343 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:52:52,345 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-02-05 11:52:52,408 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 550 statements into 1 equivalence classes.
[2025-02-05 11:52:52,488 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 550 of 550 statements.
[2025-02-05 11:52:52,488 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:52,488 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:52,490 INFO  L256         TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-02-05 11:52:52,500 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:52:53,025 INFO  L134       CoverageAnalysis]: Checked inductivity of 377 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked.
[2025-02-05 11:52:53,025 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:52:53,025 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [286180517] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:52:53,025 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:52:53,025 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7
[2025-02-05 11:52:53,025 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068281158]
[2025-02-05 11:52:53,025 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:52:53,026 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:52:53,026 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:52:53,026 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:52:53,026 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2025-02-05 11:52:53,026 INFO  L87              Difference]: Start difference. First operand 9971 states and 10729 transitions. Second operand  has 4 states, 4 states have (on average 72.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:54,214 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:52:54,214 INFO  L93              Difference]: Finished difference Result 28088 states and 30535 transitions.
[2025-02-05 11:52:54,214 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:52:54,215 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 72.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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 550
[2025-02-05 11:52:54,215 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:52:54,244 INFO  L225             Difference]: With dead ends: 28088
[2025-02-05 11:52:54,244 INFO  L226             Difference]: Without dead ends: 18418
[2025-02-05 11:52:54,254 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 549 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2025-02-05 11:52:54,256 INFO  L435           NwaCegarLoop]: 78 mSDtfsCounter, 643 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1518 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-02-05 11:52:54,256 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 153 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1518 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-02-05 11:52:54,271 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18418 states.
[2025-02-05 11:52:54,383 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18418 to 15716.
[2025-02-05 11:52:54,398 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15716 states, 15715 states have (on average 1.0877505567928731) internal successors, (17094), 15715 states have internal predecessors, (17094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:54,412 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15716 states to 15716 states and 17094 transitions.
[2025-02-05 11:52:54,412 INFO  L78                 Accepts]: Start accepts. Automaton has 15716 states and 17094 transitions. Word has length 550
[2025-02-05 11:52:54,413 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:52:54,413 INFO  L471      AbstractCegarLoop]: Abstraction has 15716 states and 17094 transitions.
[2025-02-05 11:52:54,413 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 72.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:54,413 INFO  L276                IsEmpty]: Start isEmpty. Operand 15716 states and 17094 transitions.
[2025-02-05 11:52:54,415 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 554
[2025-02-05 11:52:54,415 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:52:54,416 INFO  L218           NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:52:54,425 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-02-05 11:52:54,616 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:52:54,617 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:52:54,617 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:52:54,617 INFO  L85        PathProgramCache]: Analyzing trace with hash 532761886, now seen corresponding path program 1 times
[2025-02-05 11:52:54,617 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:52:54,617 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326671951]
[2025-02-05 11:52:54,617 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:54,618 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:52:54,656 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 553 statements into 1 equivalence classes.
[2025-02-05 11:52:54,684 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 553 of 553 statements.
[2025-02-05 11:52:54,685 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:54,685 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:54,801 INFO  L134       CoverageAnalysis]: Checked inductivity of 411 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked.
[2025-02-05 11:52:54,801 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:52:54,801 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326671951]
[2025-02-05 11:52:54,801 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326671951] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:52:54,801 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:52:54,801 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:52:54,802 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578263413]
[2025-02-05 11:52:54,802 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:52:54,802 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:52:54,802 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:52:54,802 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:52:54,802 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:54,802 INFO  L87              Difference]: Start difference. First operand 15716 states and 17094 transitions. Second operand  has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:55,749 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:52:55,750 INFO  L93              Difference]: Finished difference Result 36210 states and 39668 transitions.
[2025-02-05 11:52:55,750 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:52:55,750 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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 553
[2025-02-05 11:52:55,751 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:52:55,772 INFO  L225             Difference]: With dead ends: 36210
[2025-02-05 11:52:55,772 INFO  L226             Difference]: Without dead ends: 21396
[2025-02-05 11:52:55,784 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:55,785 INFO  L435           NwaCegarLoop]: 145 mSDtfsCounter, 335 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 11:52:55,785 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 174 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 11:52:55,795 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21396 states.
[2025-02-05 11:52:55,901 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21396 to 19599.
[2025-02-05 11:52:55,915 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19599 states, 19598 states have (on average 1.0838350852127767) internal successors, (21241), 19598 states have internal predecessors, (21241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:55,931 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19599 states to 19599 states and 21241 transitions.
[2025-02-05 11:52:55,932 INFO  L78                 Accepts]: Start accepts. Automaton has 19599 states and 21241 transitions. Word has length 553
[2025-02-05 11:52:55,932 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:52:55,932 INFO  L471      AbstractCegarLoop]: Abstraction has 19599 states and 21241 transitions.
[2025-02-05 11:52:55,932 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:55,933 INFO  L276                IsEmpty]: Start isEmpty. Operand 19599 states and 21241 transitions.
[2025-02-05 11:52:55,936 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 595
[2025-02-05 11:52:55,936 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:52:55,936 INFO  L218           NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 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, 1]
[2025-02-05 11:52:55,936 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 11:52:55,936 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:52:55,937 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:52:55,937 INFO  L85        PathProgramCache]: Analyzing trace with hash -948479819, now seen corresponding path program 1 times
[2025-02-05 11:52:55,937 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:52:55,937 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184129839]
[2025-02-05 11:52:55,937 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:55,937 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:52:55,975 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes.
[2025-02-05 11:52:55,997 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements.
[2025-02-05 11:52:55,998 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:55,998 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:56,391 INFO  L134       CoverageAnalysis]: Checked inductivity of 618 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked.
[2025-02-05 11:52:56,391 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:52:56,391 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184129839]
[2025-02-05 11:52:56,391 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184129839] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:52:56,391 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:52:56,391 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:52:56,392 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826869339]
[2025-02-05 11:52:56,392 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:52:56,392 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:52:56,393 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:52:56,393 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:52:56,393 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:56,393 INFO  L87              Difference]: Start difference. First operand 19599 states and 21241 transitions. Second operand  has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:57,303 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:52:57,304 INFO  L93              Difference]: Finished difference Result 41884 states and 45866 transitions.
[2025-02-05 11:52:57,304 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:52:57,304 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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-02-05 11:52:57,305 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:52:57,331 INFO  L225             Difference]: With dead ends: 41884
[2025-02-05 11:52:57,334 INFO  L226             Difference]: Without dead ends: 23187
[2025-02-05 11:52:57,340 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:57,344 INFO  L435           NwaCegarLoop]: 152 mSDtfsCounter, 336 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 11:52:57,345 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 169 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 11:52:57,355 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23187 states.
[2025-02-05 11:52:57,542 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23187 to 22887.
[2025-02-05 11:52:57,559 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22887 states, 22886 states have (on average 1.0909726470331207) internal successors, (24968), 22886 states have internal predecessors, (24968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:57,588 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22887 states to 22887 states and 24968 transitions.
[2025-02-05 11:52:57,588 INFO  L78                 Accepts]: Start accepts. Automaton has 22887 states and 24968 transitions. Word has length 594
[2025-02-05 11:52:57,589 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:52:57,589 INFO  L471      AbstractCegarLoop]: Abstraction has 22887 states and 24968 transitions.
[2025-02-05 11:52:57,590 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:57,590 INFO  L276                IsEmpty]: Start isEmpty. Operand 22887 states and 24968 transitions.
[2025-02-05 11:52:57,602 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 725
[2025-02-05 11:52:57,602 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:52:57,602 INFO  L218           NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:52:57,603 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 11:52:57,603 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:52:57,603 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:52:57,603 INFO  L85        PathProgramCache]: Analyzing trace with hash 592862441, now seen corresponding path program 1 times
[2025-02-05 11:52:57,604 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:52:57,604 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026832051]
[2025-02-05 11:52:57,604 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:57,605 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:52:57,673 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 724 statements into 1 equivalence classes.
[2025-02-05 11:52:57,719 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 724 of 724 statements.
[2025-02-05 11:52:57,719 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:57,720 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:58,237 INFO  L134       CoverageAnalysis]: Checked inductivity of 977 backedges. 625 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked.
[2025-02-05 11:52:58,237 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:52:58,238 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026832051]
[2025-02-05 11:52:58,238 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026832051] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:52:58,238 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:52:58,238 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 11:52:58,238 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94049320]
[2025-02-05 11:52:58,238 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:52:58,238 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 11:52:58,238 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:52:58,239 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 11:52:58,239 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:52:58,239 INFO  L87              Difference]: Start difference. First operand 22887 states and 24968 transitions. Second operand  has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:59,169 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:52:59,169 INFO  L93              Difference]: Finished difference Result 45535 states and 49695 transitions.
[2025-02-05 11:52:59,170 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:52:59,170 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 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 724
[2025-02-05 11:52:59,171 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:52:59,195 INFO  L225             Difference]: With dead ends: 45535
[2025-02-05 11:52:59,195 INFO  L226             Difference]: Without dead ends: 22949
[2025-02-05 11:52:59,216 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 11:52:59,216 INFO  L435           NwaCegarLoop]: 470 mSDtfsCounter, 666 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:52:59,217 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 513 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 11:52:59,245 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22949 states.
[2025-02-05 11:52:59,430 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22949 to 22887.
[2025-02-05 11:52:59,446 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22887 states, 22886 states have (on average 1.0659792012584113) internal successors, (24396), 22886 states have internal predecessors, (24396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:59,464 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22887 states to 22887 states and 24396 transitions.
[2025-02-05 11:52:59,466 INFO  L78                 Accepts]: Start accepts. Automaton has 22887 states and 24396 transitions. Word has length 724
[2025-02-05 11:52:59,466 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:52:59,466 INFO  L471      AbstractCegarLoop]: Abstraction has 22887 states and 24396 transitions.
[2025-02-05 11:52:59,466 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:52:59,467 INFO  L276                IsEmpty]: Start isEmpty. Operand 22887 states and 24396 transitions.
[2025-02-05 11:52:59,480 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 727
[2025-02-05 11:52:59,480 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:52:59,481 INFO  L218           NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:52:59,481 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 11:52:59,481 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:52:59,482 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:52:59,485 INFO  L85        PathProgramCache]: Analyzing trace with hash -114816417, now seen corresponding path program 1 times
[2025-02-05 11:52:59,486 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:52:59,486 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43116740]
[2025-02-05 11:52:59,486 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:52:59,486 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:52:59,558 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 726 statements into 1 equivalence classes.
[2025-02-05 11:52:59,607 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 726 of 726 statements.
[2025-02-05 11:52:59,608 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:52:59,608 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:52:59,803 INFO  L134       CoverageAnalysis]: Checked inductivity of 817 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked.
[2025-02-05 11:52:59,804 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:52:59,804 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43116740]
[2025-02-05 11:52:59,804 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43116740] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:52:59,804 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:52:59,804 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:52:59,804 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910965442]
[2025-02-05 11:52:59,804 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:52:59,805 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:52:59,805 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:52:59,805 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:52:59,805 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:52:59,805 INFO  L87              Difference]: Start difference. First operand 22887 states and 24396 transitions. Second operand  has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:00,516 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:53:00,516 INFO  L93              Difference]: Finished difference Result 46363 states and 49486 transitions.
[2025-02-05 11:53:00,516 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:53:00,517 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 726
[2025-02-05 11:53:00,517 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:53:00,539 INFO  L225             Difference]: With dead ends: 46363
[2025-02-05 11:53:00,540 INFO  L226             Difference]: Without dead ends: 24976
[2025-02-05 11:53:00,554 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:53:00,555 INFO  L435           NwaCegarLoop]: 403 mSDtfsCounter, 395 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:53:00,555 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 422 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 11:53:00,569 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24976 states.
[2025-02-05 11:53:00,656 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24976 to 12654.
[2025-02-05 11:53:00,661 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12654 states, 12653 states have (on average 1.0637793408677785) internal successors, (13460), 12653 states have internal predecessors, (13460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:00,670 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12654 states to 12654 states and 13460 transitions.
[2025-02-05 11:53:00,670 INFO  L78                 Accepts]: Start accepts. Automaton has 12654 states and 13460 transitions. Word has length 726
[2025-02-05 11:53:00,671 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:53:00,671 INFO  L471      AbstractCegarLoop]: Abstraction has 12654 states and 13460 transitions.
[2025-02-05 11:53:00,671 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:00,671 INFO  L276                IsEmpty]: Start isEmpty. Operand 12654 states and 13460 transitions.
[2025-02-05 11:53:00,676 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 742
[2025-02-05 11:53:00,676 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:53:00,677 INFO  L218           NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:53:00,677 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 11:53:00,677 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:53:00,677 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:53:00,678 INFO  L85        PathProgramCache]: Analyzing trace with hash 1029918640, now seen corresponding path program 1 times
[2025-02-05 11:53:00,678 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:53:00,678 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567115689]
[2025-02-05 11:53:00,678 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:53:00,678 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:53:00,722 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 741 statements into 1 equivalence classes.
[2025-02-05 11:53:00,749 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 741 of 741 statements.
[2025-02-05 11:53:00,750 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:53:00,750 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:53:01,479 INFO  L134       CoverageAnalysis]: Checked inductivity of 845 backedges. 631 proven. 26 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked.
[2025-02-05 11:53:01,479 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:53:01,479 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567115689]
[2025-02-05 11:53:01,480 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567115689] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:53:01,480 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629719480]
[2025-02-05 11:53:01,480 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:53:01,480 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:53:01,480 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:53:01,484 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:53:01,485 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-02-05 11:53:01,592 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 741 statements into 1 equivalence classes.
[2025-02-05 11:53:01,708 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 741 of 741 statements.
[2025-02-05 11:53:01,708 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:53:01,708 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:53:01,710 INFO  L256         TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-02-05 11:53:01,719 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:53:02,414 INFO  L134       CoverageAnalysis]: Checked inductivity of 845 backedges. 581 proven. 76 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked.
[2025-02-05 11:53:02,415 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 11:53:03,706 INFO  L134       CoverageAnalysis]: Checked inductivity of 845 backedges. 506 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked.
[2025-02-05 11:53:03,707 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [629719480] provided 1 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:53:03,707 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-02-05 11:53:03,707 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 8
[2025-02-05 11:53:03,707 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663437519]
[2025-02-05 11:53:03,707 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:53:03,708 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:53:03,708 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:53:03,709 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:53:03,709 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-02-05 11:53:03,709 INFO  L87              Difference]: Start difference. First operand 12654 states and 13460 transitions. Second operand  has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:04,558 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:53:04,559 INFO  L93              Difference]: Finished difference Result 28001 states and 29730 transitions.
[2025-02-05 11:53:04,559 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:53:04,559 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 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 741
[2025-02-05 11:53:04,559 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:53:04,570 INFO  L225             Difference]: With dead ends: 28001
[2025-02-05 11:53:04,570 INFO  L226             Difference]: Without dead ends: 15648
[2025-02-05 11:53:04,576 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1486 GetRequests, 1480 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-02-05 11:53:04,576 INFO  L435           NwaCegarLoop]: 69 mSDtfsCounter, 161 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:53:04,576 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 84 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 11:53:04,582 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15648 states.
[2025-02-05 11:53:04,648 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15648 to 14448.
[2025-02-05 11:53:04,654 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 14448 states, 14447 states have (on average 1.058974181490967) internal successors, (15299), 14447 states have internal predecessors, (15299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:04,664 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14448 states to 14448 states and 15299 transitions.
[2025-02-05 11:53:04,664 INFO  L78                 Accepts]: Start accepts. Automaton has 14448 states and 15299 transitions. Word has length 741
[2025-02-05 11:53:04,665 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:53:04,665 INFO  L471      AbstractCegarLoop]: Abstraction has 14448 states and 15299 transitions.
[2025-02-05 11:53:04,665 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:04,665 INFO  L276                IsEmpty]: Start isEmpty. Operand 14448 states and 15299 transitions.
[2025-02-05 11:53:04,671 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 754
[2025-02-05 11:53:04,671 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:53:04,671 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:53:04,677 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-02-05 11:53:04,871 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:53:04,872 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:53:04,872 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:53:04,873 INFO  L85        PathProgramCache]: Analyzing trace with hash -836497400, now seen corresponding path program 1 times
[2025-02-05 11:53:04,873 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:53:04,873 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440445623]
[2025-02-05 11:53:04,873 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:53:04,873 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:53:04,913 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 753 statements into 1 equivalence classes.
[2025-02-05 11:53:04,941 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 753 of 753 statements.
[2025-02-05 11:53:04,941 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:53:04,941 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:53:05,957 INFO  L134       CoverageAnalysis]: Checked inductivity of 900 backedges. 598 proven. 106 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked.
[2025-02-05 11:53:05,957 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:53:05,957 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440445623]
[2025-02-05 11:53:05,957 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440445623] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:53:05,957 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826541359]
[2025-02-05 11:53:05,957 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:53:05,957 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:53:05,957 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:53:05,959 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:53:05,960 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-02-05 11:53:06,026 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 753 statements into 1 equivalence classes.
[2025-02-05 11:53:06,130 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 753 of 753 statements.
[2025-02-05 11:53:06,130 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:53:06,130 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:53:06,133 INFO  L256         TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-02-05 11:53:06,138 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:53:06,820 INFO  L134       CoverageAnalysis]: Checked inductivity of 900 backedges. 598 proven. 106 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked.
[2025-02-05 11:53:06,821 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 11:53:09,399 INFO  L134       CoverageAnalysis]: Checked inductivity of 900 backedges. 598 proven. 106 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked.
[2025-02-05 11:53:09,400 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826541359] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-05 11:53:09,400 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-05 11:53:09,400 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9
[2025-02-05 11:53:09,400 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452671580]
[2025-02-05 11:53:09,400 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-05 11:53:09,401 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-02-05 11:53:09,401 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:53:09,402 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-02-05 11:53:09,402 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2025-02-05 11:53:09,403 INFO  L87              Difference]: Start difference. First operand 14448 states and 15299 transitions. Second operand  has 10 states, 10 states have (on average 132.8) internal successors, (1328), 9 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:13,697 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:53:13,697 INFO  L93              Difference]: Finished difference Result 41520 states and 43803 transitions.
[2025-02-05 11:53:13,697 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-02-05 11:53:13,698 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 132.8) internal successors, (1328), 9 states have internal predecessors, (1328), 0 states have call successors, (0), 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 753
[2025-02-05 11:53:13,698 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:53:13,719 INFO  L225             Difference]: With dead ends: 41520
[2025-02-05 11:53:13,719 INFO  L226             Difference]: Without dead ends: 27373
[2025-02-05 11:53:13,726 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1515 GetRequests, 1501 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240
[2025-02-05 11:53:13,726 INFO  L435           NwaCegarLoop]: 49 mSDtfsCounter, 2159 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 5397 mSolverCounterSat, 809 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2159 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 6206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 809 IncrementalHoareTripleChecker+Valid, 5397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time
[2025-02-05 11:53:13,727 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2159 Valid, 254 Invalid, 6206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [809 Valid, 5397 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time]
[2025-02-05 11:53:13,737 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 27373 states.
[2025-02-05 11:53:13,861 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 27373 to 20138.
[2025-02-05 11:53:13,872 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20138 states, 20137 states have (on average 1.052540100312857) internal successors, (21195), 20137 states have internal predecessors, (21195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:13,888 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20138 states to 20138 states and 21195 transitions.
[2025-02-05 11:53:13,889 INFO  L78                 Accepts]: Start accepts. Automaton has 20138 states and 21195 transitions. Word has length 753
[2025-02-05 11:53:13,889 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:53:13,889 INFO  L471      AbstractCegarLoop]: Abstraction has 20138 states and 21195 transitions.
[2025-02-05 11:53:13,890 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 132.8) internal successors, (1328), 9 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:53:13,890 INFO  L276                IsEmpty]: Start isEmpty. Operand 20138 states and 21195 transitions.
[2025-02-05 11:53:13,899 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 766
[2025-02-05 11:53:13,900 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:53:13,900 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:53:13,910 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-02-05 11:53:14,102 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2025-02-05 11:53:14,102 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:53:14,103 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:53:14,103 INFO  L85        PathProgramCache]: Analyzing trace with hash -844370742, now seen corresponding path program 1 times
[2025-02-05 11:53:14,103 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:53:14,103 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171578858]
[2025-02-05 11:53:14,103 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:53:14,103 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:53:14,153 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 765 statements into 1 equivalence classes.
[2025-02-05 11:53:14,271 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 765 of 765 statements.
[2025-02-05 11:53:14,274 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:53:14,274 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-05 11:53:14,275 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-05 11:53:14,294 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 765 statements into 1 equivalence classes.
[2025-02-05 11:53:14,371 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 765 of 765 statements.
[2025-02-05 11:53:14,371 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:53:14,371 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-05 11:53:14,430 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-02-05 11:53:14,430 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-02-05 11:53:14,431 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-02-05 11:53:14,434 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-02-05 11:53:14,437 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:53:14,631 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-02-05 11:53:14,634 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:53:14 BoogieIcfgContainer
[2025-02-05 11:53:14,634 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-02-05 11:53:14,635 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-05 11:53:14,635 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-05 11:53:14,635 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-05 11:53:14,637 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:52:29" (3/4) ...
[2025-02-05 11:53:14,637 INFO  L140         WitnessPrinter]: Generating witness for reachability counterexample
[2025-02-05 11:53:14,866 INFO  L127   tionWitnessGenerator]: Generated YAML witness of length 768.
[2025-02-05 11:53:15,053 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-02-05 11:53:15,053 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-02-05 11:53:15,054 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-05 11:53:15,055 INFO  L158              Benchmark]: Toolchain (without parser) took 48889.79ms. Allocated memory was 142.6MB in the beginning and 612.4MB in the end (delta: 469.8MB). Free memory was 104.3MB in the beginning and 231.4MB in the end (delta: -127.0MB). Peak memory consumption was 339.9MB. Max. memory is 16.1GB.
[2025-02-05 11:53:15,055 INFO  L158              Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-02-05 11:53:15,055 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 669.68ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 91.1MB in the end (delta: 13.2MB). Peak memory consumption was 80.3MB. Max. memory is 16.1GB.
[2025-02-05 11:53:15,055 INFO  L158              Benchmark]: Boogie Procedure Inliner took 145.85ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 54.0MB in the end (delta: 37.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
[2025-02-05 11:53:15,056 INFO  L158              Benchmark]: Boogie Preprocessor took 257.97ms. Allocated memory is still 142.6MB. Free memory was 54.0MB in the beginning and 82.0MB in the end (delta: -28.0MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB.
[2025-02-05 11:53:15,056 INFO  L158              Benchmark]: IcfgBuilder took 2454.82ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 82.0MB in the beginning and 152.6MB in the end (delta: -70.6MB). Peak memory consumption was 176.8MB. Max. memory is 16.1GB.
[2025-02-05 11:53:15,056 INFO  L158              Benchmark]: TraceAbstraction took 44933.44ms. Allocated memory was 335.5MB in the beginning and 612.4MB in the end (delta: 276.8MB). Free memory was 152.6MB in the beginning and 315.3MB in the end (delta: -162.7MB). Peak memory consumption was 116.0MB. Max. memory is 16.1GB.
[2025-02-05 11:53:15,057 INFO  L158              Benchmark]: Witness Printer took 418.61ms. Allocated memory is still 612.4MB. Free memory was 315.3MB in the beginning and 231.4MB in the end (delta: 83.9MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB.
[2025-02-05 11:53:15,059 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.25ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 669.68ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 91.1MB in the end (delta: 13.2MB). Peak memory consumption was 80.3MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 145.85ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 54.0MB in the end (delta: 37.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 257.97ms. Allocated memory is still 142.6MB. Free memory was 54.0MB in the beginning and 82.0MB in the end (delta: -28.0MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB.
 * IcfgBuilder took 2454.82ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 82.0MB in the beginning and 152.6MB in the end (delta: -70.6MB). Peak memory consumption was 176.8MB. Max. memory is 16.1GB.
 * TraceAbstraction took 44933.44ms. Allocated memory was 335.5MB in the beginning and 612.4MB in the end (delta: 276.8MB). Free memory was 152.6MB in the beginning and 315.3MB in the end (delta: -162.7MB). Peak memory consumption was 116.0MB. Max. memory is 16.1GB.
 * Witness Printer took 418.61ms. Allocated memory is still 612.4MB. Free memory was 315.3MB in the beginning and 231.4MB in the end (delta: 83.9MB). Peak memory consumption was 83.9MB. 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: 62]: 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, 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=5, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L489]   COND TRUE   ( -61 < a0  && ( a4 <=  -86  && ((input == 5) && (((  ((-16 < a29) && (43 >= a29))  && (a2==2)) || ((a2==2) &&  43 < a29 )) || ( a29 <=  -144  && (a2==3))))))
[L490]               a4 = (((((a4 % 21)+ -47) + 367614) + 116418) + -484038)
[L491]               a0 = ((((a0 / 5) / 5) % 24)+ -122)
[L492]               a29 = (((a29 / 5) + 298882) - 164223)
[L493]               a2 = 3
[L495]               return 21;
         VAL         [\result=21, a0=-123, a29=135549, a2=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, 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=-123, a29=135549, a2=3, a4=-58, input=3, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L929]   COND TRUE   (  ((-147 < a0) && (-98 >= a0))  && ((((  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ) && (input == 3)) &&   ((-86 < a4) && (-42 >= a4)) ) && (a2==3)))
[L930]               a0 = ((((a0 - -11543) + -341421) * 10)/ 9)
[L931]               a29 = ((((a29 / 5) % 63)+ -79) * 1)
[L932]               a2 = 4
[L934]               return 22;
         VAL         [\result=22, a0=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, 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=-366667, a29=-60, a2=4, a4=-58, input=4, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1048]  COND TRUE   ( a0 <=  -147  && ((((((a2==3) &&  43 < a29 ) || ( a29 <=  -144  && (a2==4))) || ((a2==4) &&   ((-144 < a29) && (-16 >= a29)) )) && (input == 4)) &&   ((-86 < a4) && (-42 >= a4)) ))
[L1049]              a4 = (((a4 - -368988) + -509555) * 4)
[L1050]              a29 = (((a29 / 5) - 269560) - -609922)
[L1051]              a2 = 4
[L1053]              return -1;
         VAL         [\result=-1, a0=-366667, a29=340350, a2=4, a4=-562500, 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=-366667, a29=340350, a2=4, a4=-562500, input=2, 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=-366667, a29=340350, a2=4, a4=-562500, input=2, 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=-366667, a29=340350, a2=4, a4=-562500, input=2, 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=-366667, a29=340350, a2=4, a4=-562500, input=2, 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=-366667, a29=340350, a2=4, a4=-562500, input=2, 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=-366667, a29=340350, a2=4, a4=-562500, input=2, 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=-366667, a29=340350, a2=4, a4=-562500, input=2, 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=-366667, a29=340350, a2=4, a4=-562500, input=2, 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=-366667, a29=340350, a2=4, a4=-562500, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L61]    COND TRUE   ((((a2==4) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&  43 < a29 )
         VAL         [a0=-366667, a29=340350, a2=4, a4=-562500, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L62]                reach_error()
         VAL         [a0=-366667, a29=340350, a2=4, a4=-562500, input=2, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.7s, OverallIterations: 18, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 26.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11297 SdHoareTripleChecker+Valid, 24.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11297 mSDsluCounter, 5003 SdHoareTripleChecker+Invalid, 20.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 960 mSDsCounter, 4218 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25699 IncrementalHoareTripleChecker+Invalid, 29917 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4218 mSolverCounterUnsat, 4043 mSDtfsCounter, 25699 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3967 GetRequests, 3912 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22887occurred in iteration=13, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 28968 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 10586 NumberOfCodeBlocks, 10586 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 11473 ConstructedInterpolants, 0 QuantifiedInterpolants, 46437 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2696 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 24 InterpolantComputations, 15 PerfectInterpolantSequences, 9797/10353 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-02-05 11:53:15,109 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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