./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 c7c6ca5d
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_label14.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 970a84593c0bec11fea8b95335966215ba468481b559446652c2d60f98ba63c5
--- Real Ultimate output ---
This is Ultimate 0.2.5-?-c7c6ca5-m
[2024-11-08 11:28:52,065 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-08 11:28:52,129 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-08 11:28:52,135 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 11:28:52,135 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 11:28:52,157 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 11:28:52,157 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 11:28:52,157 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 11:28:52,158 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 11:28:52,158 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-08 11:28:52,158 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 11:28:52,158 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 11:28:52,159 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 11:28:52,159 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-08 11:28:52,159 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-08 11:28:52,160 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 11:28:52,160 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-11-08 11:28:52,160 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-08 11:28:52,160 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-08 11:28:52,160 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-08 11:28:52,161 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-08 11:28:52,164 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 11:28:52,164 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 11:28:52,164 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 11:28:52,164 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-08 11:28:52,164 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-08 11:28:52,164 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-11-08 11:28:52,165 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-08 11:28:52,165 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 11:28:52,165 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-08 11:28:52,165 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 11:28:52,165 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-08 11:28:52,166 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 11:28:52,166 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 11:28:52,166 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 11:28:52,166 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 11:28:52,166 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-08 11:28:52,166 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 11:28:52,167 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 11:28:52,167 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 11:28:52,167 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 11:28:52,168 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 11:28:52,168 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 970a84593c0bec11fea8b95335966215ba468481b559446652c2d60f98ba63c5
[2024-11-08 11:28:52,364 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 11:28:52,382 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 11:28:52,384 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 11:28:52,384 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-08 11:28:52,385 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-08 11:28:52,385 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label14.c
[2024-11-08 11:28:53,603 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-08 11:28:53,861 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-08 11:28:53,862 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label14.c
[2024-11-08 11:28:53,883 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/800236077/13232190d15a484fbc8650e557768526/FLAG159115fec
[2024-11-08 11:28:53,897 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/800236077/13232190d15a484fbc8650e557768526
[2024-11-08 11:28:53,898 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 11:28:53,899 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 11:28:53,901 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 11:28:53,902 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 11:28:53,905 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 11:28:53,906 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:28:53" (1/1) ...
[2024-11-08 11:28:53,907 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a91c77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:53, skipping insertion in model container
[2024-11-08 11:28:53,908 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:28:53" (1/1) ...
[2024-11-08 11:28:53,966 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-08 11:28:54,135 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label14.c[2008,2021]
[2024-11-08 11:28:54,405 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-08 11:28:54,413 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-08 11:28:54,428 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label14.c[2008,2021]
[2024-11-08 11:28:54,571 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-08 11:28:54,587 INFO  L204         MainTranslator]: Completed translation
[2024-11-08 11:28:54,588 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:54 WrapperNode
[2024-11-08 11:28:54,588 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 11:28:54,589 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 11:28:54,589 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 11:28:54,589 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 11:28:54,594 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:54" (1/1) ...
[2024-11-08 11:28:54,617 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:54" (1/1) ...
[2024-11-08 11:28:54,734 INFO  L138                Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760
[2024-11-08 11:28:54,735 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 11:28:54,736 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 11:28:54,736 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 11:28:54,736 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 11:28:54,744 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:54" (1/1) ...
[2024-11-08 11:28:54,745 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:54" (1/1) ...
[2024-11-08 11:28:54,799 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:54" (1/1) ...
[2024-11-08 11:28:54,864 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].
[2024-11-08 11:28:54,865 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:54" (1/1) ...
[2024-11-08 11:28:54,865 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:54" (1/1) ...
[2024-11-08 11:28:54,918 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:54" (1/1) ...
[2024-11-08 11:28:54,931 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:54" (1/1) ...
[2024-11-08 11:28:54,958 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:54" (1/1) ...
[2024-11-08 11:28:54,965 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:54" (1/1) ...
[2024-11-08 11:28:54,991 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 11:28:54,992 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 11:28:54,993 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 11:28:54,993 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-08 11:28:54,994 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:54" (1/1) ...
[2024-11-08 11:28:54,998 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 11:28:55,006 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 11:28:55,019 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 11:28:55,022 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 11:28:55,058 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 11:28:55,058 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 11:28:55,059 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 11:28:55,059 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 11:28:55,113 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-08 11:28:55,114 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 11:28:56,834 INFO  L?                        ?]: Removed 246 outVars from TransFormulas that were not future-live.
[2024-11-08 11:28:56,835 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-08 11:28:56,858 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 11:28:56,860 INFO  L316             CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 11:28:56,864 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:28:56 BoogieIcfgContainer
[2024-11-08 11:28:56,864 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 11:28:56,866 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 11:28:56,866 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 11:28:56,868 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-08 11:28:56,868 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:28:53" (1/3) ...
[2024-11-08 11:28:56,869 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dfeba5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:28:56, skipping insertion in model container
[2024-11-08 11:28:56,869 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:28:54" (2/3) ...
[2024-11-08 11:28:56,870 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dfeba5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:28:56, skipping insertion in model container
[2024-11-08 11:28:56,870 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:28:56" (3/3) ...
[2024-11-08 11:28:56,871 INFO  L112   eAbstractionObserver]: Analyzing ICFG Problem15_label14.c
[2024-11-08 11:28:56,883 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 11:28:56,883 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 11:28:56,949 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 11:28:56,954 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;@4adf2e03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 11:28:56,954 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 11:28:56,958 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:28:56,962 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2024-11-08 11:28:56,963 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:28:56,963 INFO  L215           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 11:28:56,963 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:28:56,967 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:28:56,967 INFO  L85        PathProgramCache]: Analyzing trace with hash -884752143, now seen corresponding path program 1 times
[2024-11-08 11:28:56,973 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:28:56,974 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091799222]
[2024-11-08 11:28:56,974 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:28:56,974 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:28:57,071 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:28:57,151 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 11:28:57,151 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:28:57,152 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091799222]
[2024-11-08 11:28:57,152 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091799222] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:28:57,152 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 11:28:57,152 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 11:28:57,153 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981236849]
[2024-11-08 11:28:57,154 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:28:57,156 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:28:57,157 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:28:57,175 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:28:57,175 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:28:57,179 INFO  L87              Difference]: Start difference. First operand  has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 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)
[2024-11-08 11:28:58,870 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:28:58,870 INFO  L93              Difference]: Finished difference Result 1191 states and 2157 transitions.
[2024-11-08 11:28:58,871 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:28:58,872 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
[2024-11-08 11:28:58,872 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:28:58,883 INFO  L225             Difference]: With dead ends: 1191
[2024-11-08 11:28:58,883 INFO  L226             Difference]: Without dead ends: 688
[2024-11-08 11:28:58,886 INFO  L431           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
[2024-11-08 11:28:58,888 INFO  L432           NwaCegarLoop]: 189 mSDtfsCounter, 356 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 230 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.6s IncrementalHoareTripleChecker+Time
[2024-11-08 11:28:58,889 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 230 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2024-11-08 11:28:58,902 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 688 states.
[2024-11-08 11:28:58,946 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 680.
[2024-11-08 11:28:58,948 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)
[2024-11-08 11:28:58,949 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1093 transitions.
[2024-11-08 11:28:58,950 INFO  L78                 Accepts]: Start accepts. Automaton has 680 states and 1093 transitions. Word has length 15
[2024-11-08 11:28:58,950 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:28:58,951 INFO  L471      AbstractCegarLoop]: Abstraction has 680 states and 1093 transitions.
[2024-11-08 11:28:58,951 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)
[2024-11-08 11:28:58,951 INFO  L276                IsEmpty]: Start isEmpty. Operand 680 states and 1093 transitions.
[2024-11-08 11:28:58,953 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2024-11-08 11:28:58,953 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:28:58,953 INFO  L215           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]
[2024-11-08 11:28:58,953 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 11:28:58,953 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:28:58,954 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:28:58,954 INFO  L85        PathProgramCache]: Analyzing trace with hash 1737686017, now seen corresponding path program 1 times
[2024-11-08 11:28:58,954 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:28:58,954 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818118014]
[2024-11-08 11:28:58,954 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:28:58,954 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:28:59,020 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:28:59,196 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 11:28:59,196 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:28:59,196 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818118014]
[2024-11-08 11:28:59,196 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818118014] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:28:59,197 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 11:28:59,197 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 11:28:59,197 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926955596]
[2024-11-08 11:28:59,197 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:28:59,198 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:28:59,198 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:28:59,198 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:28:59,198 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:28:59,199 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)
[2024-11-08 11:29:00,307 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:29:00,308 INFO  L93              Difference]: Finished difference Result 1964 states and 3171 transitions.
[2024-11-08 11:29:00,308 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:29:00,308 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
[2024-11-08 11:29:00,309 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:29:00,312 INFO  L225             Difference]: With dead ends: 1964
[2024-11-08 11:29:00,312 INFO  L226             Difference]: Without dead ends: 1286
[2024-11-08 11:29:00,314 INFO  L431           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
[2024-11-08 11:29:00,314 INFO  L432           NwaCegarLoop]: 293 mSDtfsCounter, 282 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 360 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.1s IncrementalHoareTripleChecker+Time
[2024-11-08 11:29:00,315 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 360 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2024-11-08 11:29:00,316 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1286 states.
[2024-11-08 11:29:00,332 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1281.
[2024-11-08 11:29:00,334 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)
[2024-11-08 11:29:00,336 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1786 transitions.
[2024-11-08 11:29:00,336 INFO  L78                 Accepts]: Start accepts. Automaton has 1281 states and 1786 transitions. Word has length 83
[2024-11-08 11:29:00,337 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:29:00,337 INFO  L471      AbstractCegarLoop]: Abstraction has 1281 states and 1786 transitions.
[2024-11-08 11:29:00,337 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)
[2024-11-08 11:29:00,337 INFO  L276                IsEmpty]: Start isEmpty. Operand 1281 states and 1786 transitions.
[2024-11-08 11:29:00,339 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2024-11-08 11:29:00,339 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:29:00,339 INFO  L215           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]
[2024-11-08 11:29:00,339 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-08 11:29:00,339 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:29:00,340 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:29:00,340 INFO  L85        PathProgramCache]: Analyzing trace with hash -479501163, now seen corresponding path program 1 times
[2024-11-08 11:29:00,340 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:29:00,340 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498641120]
[2024-11-08 11:29:00,340 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:29:00,341 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:29:00,367 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:29:00,610 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 11:29:00,610 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:29:00,610 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498641120]
[2024-11-08 11:29:00,610 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498641120] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:29:00,610 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 11:29:00,610 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 11:29:00,611 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671428315]
[2024-11-08 11:29:00,611 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:29:00,611 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:29:00,611 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:29:00,613 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:29:00,615 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:29:00,616 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)
[2024-11-08 11:29:01,657 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:29:01,657 INFO  L93              Difference]: Finished difference Result 2859 states and 3905 transitions.
[2024-11-08 11:29:01,657 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:29:01,658 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
[2024-11-08 11:29:01,658 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:29:01,663 INFO  L225             Difference]: With dead ends: 2859
[2024-11-08 11:29:01,663 INFO  L226             Difference]: Without dead ends: 1580
[2024-11-08 11:29:01,666 INFO  L431           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
[2024-11-08 11:29:01,668 INFO  L432           NwaCegarLoop]: 324 mSDtfsCounter, 225 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.0s IncrementalHoareTripleChecker+Time
[2024-11-08 11:29:01,670 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 359 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2024-11-08 11:29:01,672 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1580 states.
[2024-11-08 11:29:01,689 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1580.
[2024-11-08 11:29:01,691 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)
[2024-11-08 11:29:01,696 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2091 transitions.
[2024-11-08 11:29:01,696 INFO  L78                 Accepts]: Start accepts. Automaton has 1580 states and 2091 transitions. Word has length 91
[2024-11-08 11:29:01,697 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:29:01,697 INFO  L471      AbstractCegarLoop]: Abstraction has 1580 states and 2091 transitions.
[2024-11-08 11:29:01,698 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)
[2024-11-08 11:29:01,698 INFO  L276                IsEmpty]: Start isEmpty. Operand 1580 states and 2091 transitions.
[2024-11-08 11:29:01,704 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 183
[2024-11-08 11:29:01,704 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:29:01,704 INFO  L215           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]
[2024-11-08 11:29:01,706 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-08 11:29:01,706 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:29:01,707 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:29:01,707 INFO  L85        PathProgramCache]: Analyzing trace with hash -33375318, now seen corresponding path program 1 times
[2024-11-08 11:29:01,707 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:29:01,707 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260996957]
[2024-11-08 11:29:01,707 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:29:01,707 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:29:01,751 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:29:02,038 INFO  L134       CoverageAnalysis]: Checked inductivity of 100 backedges. 76 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 11:29:02,038 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:29:02,038 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260996957]
[2024-11-08 11:29:02,038 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260996957] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 11:29:02,038 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774809233]
[2024-11-08 11:29:02,039 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:29:02,039 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 11:29:02,039 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 11:29:02,041 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 11:29:02,047 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-08 11:29:02,138 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:29:02,141 INFO  L255         TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 11:29:02,146 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 11:29:02,318 INFO  L134       CoverageAnalysis]: Checked inductivity of 100 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked.
[2024-11-08 11:29:02,319 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 11:29:02,319 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [774809233] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:29:02,319 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-08 11:29:02,319 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5
[2024-11-08 11:29:02,319 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854439367]
[2024-11-08 11:29:02,319 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:29:02,320 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:29:02,320 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:29:02,320 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:29:02,320 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-08 11:29:02,321 INFO  L87              Difference]: Start difference. First operand 1580 states and 2091 transitions. Second operand  has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:03,517 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:29:03,517 INFO  L93              Difference]: Finished difference Result 4061 states and 5549 transitions.
[2024-11-08 11:29:03,518 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:29:03,518 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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
[2024-11-08 11:29:03,518 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:29:03,524 INFO  L225             Difference]: With dead ends: 4061
[2024-11-08 11:29:03,524 INFO  L226             Difference]: Without dead ends: 2782
[2024-11-08 11:29:03,525 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-08 11:29:03,526 INFO  L432           NwaCegarLoop]: 325 mSDtfsCounter, 220 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2024-11-08 11:29:03,526 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 364 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2024-11-08 11:29:03,528 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2782 states.
[2024-11-08 11:29:03,548 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2782 to 2481.
[2024-11-08 11:29:03,550 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2481 states, 2480 states have (on average 1.25) internal successors, (3100), 2480 states have internal predecessors, (3100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:03,554 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3100 transitions.
[2024-11-08 11:29:03,555 INFO  L78                 Accepts]: Start accepts. Automaton has 2481 states and 3100 transitions. Word has length 182
[2024-11-08 11:29:03,555 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:29:03,555 INFO  L471      AbstractCegarLoop]: Abstraction has 2481 states and 3100 transitions.
[2024-11-08 11:29:03,555 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:03,555 INFO  L276                IsEmpty]: Start isEmpty. Operand 2481 states and 3100 transitions.
[2024-11-08 11:29:03,558 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 298
[2024-11-08 11:29:03,558 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:29:03,558 INFO  L215           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]
[2024-11-08 11:29:03,574 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-08 11:29:03,759 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 11:29:03,759 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:29:03,759 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:29:03,760 INFO  L85        PathProgramCache]: Analyzing trace with hash -588182164, now seen corresponding path program 1 times
[2024-11-08 11:29:03,760 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:29:03,760 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551407631]
[2024-11-08 11:29:03,760 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:29:03,760 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:29:03,803 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:29:04,379 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 11:29:04,379 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:29:04,379 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551407631]
[2024-11-08 11:29:04,379 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551407631] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 11:29:04,379 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949300633]
[2024-11-08 11:29:04,380 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:29:04,380 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 11:29:04,380 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 11:29:04,382 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 11:29:04,384 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-08 11:29:04,500 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:29:04,501 INFO  L255         TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 11:29:04,507 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 11:29:04,864 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2024-11-08 11:29:04,865 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 11:29:04,865 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [949300633] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:29:04,865 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-08 11:29:04,865 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6
[2024-11-08 11:29:04,866 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770549405]
[2024-11-08 11:29:04,866 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:29:04,866 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:29:04,866 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:29:04,867 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:29:04,867 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2024-11-08 11:29:04,867 INFO  L87              Difference]: Start difference. First operand 2481 states and 3100 transitions. Second operand  has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:05,847 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:29:05,847 INFO  L93              Difference]: Finished difference Result 6164 states and 7882 transitions.
[2024-11-08 11:29:05,847 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:29:05,847 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 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
[2024-11-08 11:29:05,848 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:29:05,856 INFO  L225             Difference]: With dead ends: 6164
[2024-11-08 11:29:05,856 INFO  L226             Difference]: Without dead ends: 3984
[2024-11-08 11:29:05,858 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2024-11-08 11:29:05,859 INFO  L432           NwaCegarLoop]: 277 mSDtfsCounter, 31 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2024-11-08 11:29:05,859 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 323 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2024-11-08 11:29:05,862 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3984 states.
[2024-11-08 11:29:05,892 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3984 to 3981.
[2024-11-08 11:29:05,896 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3981 states, 3980 states have (on average 1.2045226130653266) internal successors, (4794), 3980 states have internal predecessors, (4794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:05,902 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 4794 transitions.
[2024-11-08 11:29:05,903 INFO  L78                 Accepts]: Start accepts. Automaton has 3981 states and 4794 transitions. Word has length 297
[2024-11-08 11:29:05,903 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:29:05,903 INFO  L471      AbstractCegarLoop]: Abstraction has 3981 states and 4794 transitions.
[2024-11-08 11:29:05,904 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:05,904 INFO  L276                IsEmpty]: Start isEmpty. Operand 3981 states and 4794 transitions.
[2024-11-08 11:29:05,906 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 303
[2024-11-08 11:29:05,906 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:29:05,906 INFO  L215           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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 11:29:05,919 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-08 11:29:06,107 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 11:29:06,108 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:29:06,111 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:29:06,111 INFO  L85        PathProgramCache]: Analyzing trace with hash -733361195, now seen corresponding path program 1 times
[2024-11-08 11:29:06,111 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:29:06,111 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155279454]
[2024-11-08 11:29:06,111 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:29:06,111 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:29:06,155 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:29:06,354 INFO  L134       CoverageAnalysis]: Checked inductivity of 115 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked.
[2024-11-08 11:29:06,357 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:29:06,357 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155279454]
[2024-11-08 11:29:06,357 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155279454] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:29:06,357 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 11:29:06,357 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 11:29:06,358 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650658948]
[2024-11-08 11:29:06,358 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:29:06,358 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:29:06,358 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:29:06,358 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:29:06,359 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:29:06,359 INFO  L87              Difference]: Start difference. First operand 3981 states and 4794 transitions. Second operand  has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:07,423 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:29:07,424 INFO  L93              Difference]: Finished difference Result 9465 states and 11668 transitions.
[2024-11-08 11:29:07,424 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:29:07,424 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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 302
[2024-11-08 11:29:07,424 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:29:07,436 INFO  L225             Difference]: With dead ends: 9465
[2024-11-08 11:29:07,436 INFO  L226             Difference]: Without dead ends: 5785
[2024-11-08 11:29:07,440 INFO  L431           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
[2024-11-08 11:29:07,440 INFO  L432           NwaCegarLoop]: 632 mSDtfsCounter, 301 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2024-11-08 11:29:07,441 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 671 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2024-11-08 11:29:07,444 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5785 states.
[2024-11-08 11:29:07,490 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5785 to 5783.
[2024-11-08 11:29:07,496 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5783 states, 5782 states have (on average 1.1672431684538223) internal successors, (6749), 5782 states have internal predecessors, (6749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:07,502 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5783 states to 5783 states and 6749 transitions.
[2024-11-08 11:29:07,502 INFO  L78                 Accepts]: Start accepts. Automaton has 5783 states and 6749 transitions. Word has length 302
[2024-11-08 11:29:07,503 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:29:07,503 INFO  L471      AbstractCegarLoop]: Abstraction has 5783 states and 6749 transitions.
[2024-11-08 11:29:07,503 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:07,503 INFO  L276                IsEmpty]: Start isEmpty. Operand 5783 states and 6749 transitions.
[2024-11-08 11:29:07,506 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 362
[2024-11-08 11:29:07,506 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:29:07,506 INFO  L215           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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 11:29:07,506 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-08 11:29:07,506 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:29:07,507 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:29:07,507 INFO  L85        PathProgramCache]: Analyzing trace with hash 1535926930, now seen corresponding path program 1 times
[2024-11-08 11:29:07,507 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:29:07,507 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121012286]
[2024-11-08 11:29:07,507 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:29:07,507 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:29:07,597 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:29:08,242 INFO  L134       CoverageAnalysis]: Checked inductivity of 100 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 11:29:08,242 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:29:08,243 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121012286]
[2024-11-08 11:29:08,243 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121012286] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 11:29:08,243 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544301314]
[2024-11-08 11:29:08,244 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:29:08,244 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 11:29:08,244 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 11:29:08,245 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 11:29:08,246 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-08 11:29:08,376 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:29:08,377 INFO  L255         TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 11:29:08,384 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 11:29:08,466 INFO  L134       CoverageAnalysis]: Checked inductivity of 100 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 11:29:08,467 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 11:29:08,467 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [544301314] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:29:08,467 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-08 11:29:08,467 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2024-11-08 11:29:08,468 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068978237]
[2024-11-08 11:29:08,468 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:29:08,468 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:29:08,468 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:29:08,469 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:29:08,469 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-08 11:29:08,470 INFO  L87              Difference]: Start difference. First operand 5783 states and 6749 transitions. Second operand  has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:09,510 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:29:09,510 INFO  L93              Difference]: Finished difference Result 13366 states and 15911 transitions.
[2024-11-08 11:29:09,510 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:29:09,511 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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 361
[2024-11-08 11:29:09,511 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:29:09,526 INFO  L225             Difference]: With dead ends: 13366
[2024-11-08 11:29:09,526 INFO  L226             Difference]: Without dead ends: 7884
[2024-11-08 11:29:09,530 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-08 11:29:09,531 INFO  L432           NwaCegarLoop]: 229 mSDtfsCounter, 274 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2024-11-08 11:29:09,532 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 263 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2024-11-08 11:29:09,537 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7884 states.
[2024-11-08 11:29:09,590 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7884 to 7281.
[2024-11-08 11:29:09,596 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7281 states, 7280 states have (on average 1.161401098901099) internal successors, (8455), 7280 states have internal predecessors, (8455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:09,607 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7281 states to 7281 states and 8455 transitions.
[2024-11-08 11:29:09,607 INFO  L78                 Accepts]: Start accepts. Automaton has 7281 states and 8455 transitions. Word has length 361
[2024-11-08 11:29:09,610 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:29:09,610 INFO  L471      AbstractCegarLoop]: Abstraction has 7281 states and 8455 transitions.
[2024-11-08 11:29:09,610 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:09,610 INFO  L276                IsEmpty]: Start isEmpty. Operand 7281 states and 8455 transitions.
[2024-11-08 11:29:09,614 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 467
[2024-11-08 11:29:09,614 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:29:09,614 INFO  L215           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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2024-11-08 11:29:09,631 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2024-11-08 11:29:09,815 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 11:29:09,815 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:29:09,816 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:29:09,817 INFO  L85        PathProgramCache]: Analyzing trace with hash 144358829, now seen corresponding path program 1 times
[2024-11-08 11:29:09,817 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:29:09,817 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691096086]
[2024-11-08 11:29:09,817 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:29:09,817 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:29:09,874 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:29:10,084 INFO  L134       CoverageAnalysis]: Checked inductivity of 382 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked.
[2024-11-08 11:29:10,084 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:29:10,085 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691096086]
[2024-11-08 11:29:10,085 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691096086] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:29:10,085 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 11:29:10,085 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 11:29:10,085 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538400403]
[2024-11-08 11:29:10,085 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:29:10,086 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:29:10,086 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:29:10,087 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:29:10,087 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:29:10,087 INFO  L87              Difference]: Start difference. First operand 7281 states and 8455 transitions. Second operand  has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:11,094 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:29:11,094 INFO  L93              Difference]: Finished difference Result 16059 states and 18979 transitions.
[2024-11-08 11:29:11,094 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:29:11,095 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 466
[2024-11-08 11:29:11,095 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:29:11,113 INFO  L225             Difference]: With dead ends: 16059
[2024-11-08 11:29:11,113 INFO  L226             Difference]: Without dead ends: 9079
[2024-11-08 11:29:11,119 INFO  L431           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
[2024-11-08 11:29:11,120 INFO  L432           NwaCegarLoop]: 571 mSDtfsCounter, 316 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2024-11-08 11:29:11,120 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 611 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2024-11-08 11:29:11,129 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9079 states.
[2024-11-08 11:29:11,184 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9079 to 9078.
[2024-11-08 11:29:11,193 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9078 states, 9077 states have (on average 1.1450919907458412) internal successors, (10394), 9077 states have internal predecessors, (10394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:11,202 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9078 states to 9078 states and 10394 transitions.
[2024-11-08 11:29:11,202 INFO  L78                 Accepts]: Start accepts. Automaton has 9078 states and 10394 transitions. Word has length 466
[2024-11-08 11:29:11,203 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:29:11,203 INFO  L471      AbstractCegarLoop]: Abstraction has 9078 states and 10394 transitions.
[2024-11-08 11:29:11,204 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:11,204 INFO  L276                IsEmpty]: Start isEmpty. Operand 9078 states and 10394 transitions.
[2024-11-08 11:29:11,208 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 492
[2024-11-08 11:29:11,208 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:29:11,209 INFO  L215           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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2024-11-08 11:29:11,209 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-08 11:29:11,209 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:29:11,209 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:29:11,209 INFO  L85        PathProgramCache]: Analyzing trace with hash 1244599226, now seen corresponding path program 1 times
[2024-11-08 11:29:11,210 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:29:11,210 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293519933]
[2024-11-08 11:29:11,210 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:29:11,210 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:29:11,262 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:29:11,428 INFO  L134       CoverageAnalysis]: Checked inductivity of 407 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked.
[2024-11-08 11:29:11,428 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:29:11,428 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293519933]
[2024-11-08 11:29:11,429 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293519933] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:29:11,429 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 11:29:11,429 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 11:29:11,429 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126130053]
[2024-11-08 11:29:11,429 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:29:11,429 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:29:11,430 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:29:11,430 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:29:11,430 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:29:11,430 INFO  L87              Difference]: Start difference. First operand 9078 states and 10394 transitions. Second operand  has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:12,501 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:29:12,502 INFO  L93              Difference]: Finished difference Result 20546 states and 23798 transitions.
[2024-11-08 11:29:12,502 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:29:12,502 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 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 491
[2024-11-08 11:29:12,503 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:29:12,521 INFO  L225             Difference]: With dead ends: 20546
[2024-11-08 11:29:12,521 INFO  L226             Difference]: Without dead ends: 11769
[2024-11-08 11:29:12,529 INFO  L431           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
[2024-11-08 11:29:12,529 INFO  L432           NwaCegarLoop]: 273 mSDtfsCounter, 123 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2024-11-08 11:29:12,529 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 315 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2024-11-08 11:29:12,537 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11769 states.
[2024-11-08 11:29:12,588 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11769 to 7577.
[2024-11-08 11:29:12,597 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7577 states, 7576 states have (on average 1.1601108764519534) internal successors, (8789), 7576 states have internal predecessors, (8789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:12,660 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7577 states to 7577 states and 8789 transitions.
[2024-11-08 11:29:12,660 INFO  L78                 Accepts]: Start accepts. Automaton has 7577 states and 8789 transitions. Word has length 491
[2024-11-08 11:29:12,661 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:29:12,661 INFO  L471      AbstractCegarLoop]: Abstraction has 7577 states and 8789 transitions.
[2024-11-08 11:29:12,661 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:12,661 INFO  L276                IsEmpty]: Start isEmpty. Operand 7577 states and 8789 transitions.
[2024-11-08 11:29:12,672 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 543
[2024-11-08 11:29:12,672 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:29:12,672 INFO  L215           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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2024-11-08 11:29:12,672 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-08 11:29:12,672 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:29:12,673 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:29:12,673 INFO  L85        PathProgramCache]: Analyzing trace with hash -68335791, now seen corresponding path program 1 times
[2024-11-08 11:29:12,673 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:29:12,673 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600342358]
[2024-11-08 11:29:12,673 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:29:12,673 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:29:12,729 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:29:13,143 INFO  L134       CoverageAnalysis]: Checked inductivity of 622 backedges. 481 proven. 39 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked.
[2024-11-08 11:29:13,144 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:29:13,144 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600342358]
[2024-11-08 11:29:13,144 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600342358] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 11:29:13,144 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914889343]
[2024-11-08 11:29:13,144 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:29:13,144 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 11:29:13,145 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 11:29:13,146 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 11:29:13,148 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-08 11:29:13,325 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:29:13,327 INFO  L255         TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 7 conjuncts are in the unsatisfiable core
[2024-11-08 11:29:13,333 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 11:29:13,858 INFO  L134       CoverageAnalysis]: Checked inductivity of 622 backedges. 481 proven. 39 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked.
[2024-11-08 11:29:13,858 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 11:29:14,397 INFO  L134       CoverageAnalysis]: Checked inductivity of 622 backedges. 481 proven. 39 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked.
[2024-11-08 11:29:14,398 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914889343] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 11:29:14,398 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 11:29:14,398 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8
[2024-11-08 11:29:14,398 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629716383]
[2024-11-08 11:29:14,398 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 11:29:14,399 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-08 11:29:14,399 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:29:14,400 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-08 11:29:14,400 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2024-11-08 11:29:14,400 INFO  L87              Difference]: Start difference. First operand 7577 states and 8789 transitions. Second operand  has 9 states, 9 states have (on average 82.55555555555556) internal successors, (743), 8 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:18,510 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:29:18,511 INFO  L93              Difference]: Finished difference Result 21393 states and 24692 transitions.
[2024-11-08 11:29:18,511 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-11-08 11:29:18,511 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 82.55555555555556) internal successors, (743), 8 states have internal predecessors, (743), 0 states have call successors, (0), 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
[2024-11-08 11:29:18,511 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:29:18,521 INFO  L225             Difference]: With dead ends: 21393
[2024-11-08 11:29:18,521 INFO  L226             Difference]: Without dead ends: 9671
[2024-11-08 11:29:18,525 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 1093 GetRequests, 1079 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240
[2024-11-08 11:29:18,525 INFO  L432           NwaCegarLoop]: 106 mSDtfsCounter, 2888 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 6090 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2888 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 6778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 6090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time
[2024-11-08 11:29:18,526 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [2888 Valid, 284 Invalid, 6778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 6090 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time]
[2024-11-08 11:29:18,530 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9671 states.
[2024-11-08 11:29:18,574 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9671 to 9369.
[2024-11-08 11:29:18,580 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9369 states, 9368 states have (on average 1.0763236549957302) internal successors, (10083), 9368 states have internal predecessors, (10083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:18,587 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9369 states to 9369 states and 10083 transitions.
[2024-11-08 11:29:18,587 INFO  L78                 Accepts]: Start accepts. Automaton has 9369 states and 10083 transitions. Word has length 542
[2024-11-08 11:29:18,587 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:29:18,587 INFO  L471      AbstractCegarLoop]: Abstraction has 9369 states and 10083 transitions.
[2024-11-08 11:29:18,588 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 82.55555555555556) internal successors, (743), 8 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:18,588 INFO  L276                IsEmpty]: Start isEmpty. Operand 9369 states and 10083 transitions.
[2024-11-08 11:29:18,590 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 543
[2024-11-08 11:29:18,590 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:29:18,590 INFO  L215           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]
[2024-11-08 11:29:18,606 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-11-08 11:29:18,791 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 11:29:18,791 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:29:18,792 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:29:18,793 INFO  L85        PathProgramCache]: Analyzing trace with hash -1768140986, now seen corresponding path program 1 times
[2024-11-08 11:29:18,793 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:29:18,793 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164565506]
[2024-11-08 11:29:18,793 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:29:18,793 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:29:18,859 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:29:19,064 INFO  L134       CoverageAnalysis]: Checked inductivity of 400 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked.
[2024-11-08 11:29:19,064 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:29:19,065 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164565506]
[2024-11-08 11:29:19,065 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164565506] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:29:19,065 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 11:29:19,065 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 11:29:19,065 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014943479]
[2024-11-08 11:29:19,065 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:29:19,066 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:29:19,066 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:29:19,066 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:29:19,066 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:29:19,067 INFO  L87              Difference]: Start difference. First operand 9369 states and 10083 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)
[2024-11-08 11:29:19,879 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:29:19,879 INFO  L93              Difference]: Finished difference Result 21153 states and 22828 transitions.
[2024-11-08 11:29:19,879 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:29:19,879 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
[2024-11-08 11:29:19,880 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:29:19,890 INFO  L225             Difference]: With dead ends: 21153
[2024-11-08 11:29:19,891 INFO  L226             Difference]: Without dead ends: 12085
[2024-11-08 11:29:19,897 INFO  L431           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
[2024-11-08 11:29:19,898 INFO  L432           NwaCegarLoop]: 183 mSDtfsCounter, 322 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2024-11-08 11:29:19,898 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 219 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2024-11-08 11:29:19,905 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12085 states.
[2024-11-08 11:29:19,959 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12085 to 9371.
[2024-11-08 11:29:19,965 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9371 states, 9370 states have (on average 1.075453575240128) internal successors, (10077), 9370 states have internal predecessors, (10077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:19,971 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9371 states to 9371 states and 10077 transitions.
[2024-11-08 11:29:19,972 INFO  L78                 Accepts]: Start accepts. Automaton has 9371 states and 10077 transitions. Word has length 542
[2024-11-08 11:29:19,972 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:29:19,972 INFO  L471      AbstractCegarLoop]: Abstraction has 9371 states and 10077 transitions.
[2024-11-08 11:29:19,972 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)
[2024-11-08 11:29:19,973 INFO  L276                IsEmpty]: Start isEmpty. Operand 9371 states and 10077 transitions.
[2024-11-08 11:29:19,975 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 551
[2024-11-08 11:29:19,975 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:29:19,975 INFO  L215           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]
[2024-11-08 11:29:19,975 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-08 11:29:19,975 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:29:19,976 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:29:19,976 INFO  L85        PathProgramCache]: Analyzing trace with hash -240527515, now seen corresponding path program 1 times
[2024-11-08 11:29:19,976 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:29:19,976 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682371376]
[2024-11-08 11:29:19,976 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:29:19,976 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:29:20,038 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:29:20,588 INFO  L134       CoverageAnalysis]: Checked inductivity of 377 backedges. 176 proven. 13 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked.
[2024-11-08 11:29:20,588 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:29:20,588 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682371376]
[2024-11-08 11:29:20,588 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682371376] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 11:29:20,588 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50373388]
[2024-11-08 11:29:20,588 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:29:20,589 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 11:29:20,589 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 11:29:20,590 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 11:29:20,591 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-11-08 11:29:20,741 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:29:20,743 INFO  L255         TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-08 11:29:20,747 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 11:29:21,298 INFO  L134       CoverageAnalysis]: Checked inductivity of 377 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked.
[2024-11-08 11:29:21,299 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 11:29:21,299 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [50373388] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:29:21,299 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-08 11:29:21,299 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7
[2024-11-08 11:29:21,299 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004325448]
[2024-11-08 11:29:21,299 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:29:21,300 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 11:29:21,300 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:29:21,301 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 11:29:21,301 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-11-08 11:29:21,301 INFO  L87              Difference]: Start difference. First operand 9371 states and 10077 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)
[2024-11-08 11:29:22,447 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:29:22,447 INFO  L93              Difference]: Finished difference Result 28684 states and 30918 transitions.
[2024-11-08 11:29:22,447 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-08 11:29:22,447 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
[2024-11-08 11:29:22,448 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:29:22,467 INFO  L225             Difference]: With dead ends: 28684
[2024-11-08 11:29:22,468 INFO  L226             Difference]: Without dead ends: 19614
[2024-11-08 11:29:22,477 INFO  L431           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
[2024-11-08 11:29:22,478 INFO  L432           NwaCegarLoop]: 81 mSDtfsCounter, 552 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 1534 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 1632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2024-11-08 11:29:22,478 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 171 Invalid, 1632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1534 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2024-11-08 11:29:22,489 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19614 states.
[2024-11-08 11:29:22,592 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19614 to 16316.
[2024-11-08 11:29:22,602 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 16316 states, 16315 states have (on average 1.0734906527735213) internal successors, (17514), 16315 states have internal predecessors, (17514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:22,616 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16316 states to 16316 states and 17514 transitions.
[2024-11-08 11:29:22,617 INFO  L78                 Accepts]: Start accepts. Automaton has 16316 states and 17514 transitions. Word has length 550
[2024-11-08 11:29:22,617 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:29:22,617 INFO  L471      AbstractCegarLoop]: Abstraction has 16316 states and 17514 transitions.
[2024-11-08 11:29:22,617 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)
[2024-11-08 11:29:22,617 INFO  L276                IsEmpty]: Start isEmpty. Operand 16316 states and 17514 transitions.
[2024-11-08 11:29:22,620 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 554
[2024-11-08 11:29:22,620 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:29:22,620 INFO  L215           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]
[2024-11-08 11:29:22,635 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2024-11-08 11:29:22,821 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2024-11-08 11:29:22,821 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:29:22,821 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:29:22,822 INFO  L85        PathProgramCache]: Analyzing trace with hash -2139538966, now seen corresponding path program 1 times
[2024-11-08 11:29:22,822 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:29:22,822 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479347816]
[2024-11-08 11:29:22,822 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:29:22,822 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:29:22,892 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:29:23,031 INFO  L134       CoverageAnalysis]: Checked inductivity of 411 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked.
[2024-11-08 11:29:23,032 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:29:23,032 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479347816]
[2024-11-08 11:29:23,032 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479347816] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:29:23,032 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 11:29:23,032 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 11:29:23,032 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032293598]
[2024-11-08 11:29:23,032 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:29:23,033 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:29:23,033 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:29:23,033 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:29:23,034 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:29:23,034 INFO  L87              Difference]: Start difference. First operand 16316 states and 17514 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)
[2024-11-08 11:29:23,868 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:29:23,869 INFO  L93              Difference]: Finished difference Result 39203 states and 42226 transitions.
[2024-11-08 11:29:23,869 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:29:23,869 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
[2024-11-08 11:29:23,869 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:29:23,893 INFO  L225             Difference]: With dead ends: 39203
[2024-11-08 11:29:23,894 INFO  L226             Difference]: Without dead ends: 24088
[2024-11-08 11:29:23,905 INFO  L431           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
[2024-11-08 11:29:23,906 INFO  L432           NwaCegarLoop]: 132 mSDtfsCounter, 336 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2024-11-08 11:29:23,906 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 160 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2024-11-08 11:29:23,919 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24088 states.
[2024-11-08 11:29:24,047 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24088 to 22892.
[2024-11-08 11:29:24,062 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22892 states, 22891 states have (on average 1.067275348390197) internal successors, (24431), 22891 states have internal predecessors, (24431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:24,082 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22892 states to 22892 states and 24431 transitions.
[2024-11-08 11:29:24,083 INFO  L78                 Accepts]: Start accepts. Automaton has 22892 states and 24431 transitions. Word has length 553
[2024-11-08 11:29:24,083 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:29:24,083 INFO  L471      AbstractCegarLoop]: Abstraction has 22892 states and 24431 transitions.
[2024-11-08 11:29:24,083 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)
[2024-11-08 11:29:24,084 INFO  L276                IsEmpty]: Start isEmpty. Operand 22892 states and 24431 transitions.
[2024-11-08 11:29:24,090 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 691
[2024-11-08 11:29:24,091 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:29:24,091 INFO  L215           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, 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, 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]
[2024-11-08 11:29:24,091 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-11-08 11:29:24,091 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:29:24,092 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:29:24,092 INFO  L85        PathProgramCache]: Analyzing trace with hash -1272585067, now seen corresponding path program 1 times
[2024-11-08 11:29:24,093 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:29:24,093 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228268023]
[2024-11-08 11:29:24,093 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:29:24,093 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:29:24,167 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:29:24,399 INFO  L134       CoverageAnalysis]: Checked inductivity of 994 backedges. 558 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked.
[2024-11-08 11:29:24,399 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:29:24,399 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228268023]
[2024-11-08 11:29:24,399 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228268023] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:29:24,399 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 11:29:24,400 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 11:29:24,400 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339045432]
[2024-11-08 11:29:24,400 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:29:24,401 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:29:24,401 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:29:24,401 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:29:24,401 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:29:24,402 INFO  L87              Difference]: Start difference. First operand 22892 states and 24431 transitions. Second operand  has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:25,062 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:29:25,063 INFO  L93              Difference]: Finished difference Result 44581 states and 47652 transitions.
[2024-11-08 11:29:25,063 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:29:25,063 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 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 690
[2024-11-08 11:29:25,063 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:29:25,085 INFO  L225             Difference]: With dead ends: 44581
[2024-11-08 11:29:25,085 INFO  L226             Difference]: Without dead ends: 23189
[2024-11-08 11:29:25,099 INFO  L431           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
[2024-11-08 11:29:25,100 INFO  L432           NwaCegarLoop]: 65 mSDtfsCounter, 438 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-08 11:29:25,100 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 70 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-08 11:29:25,111 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23189 states.
[2024-11-08 11:29:25,236 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23189 to 22890.
[2024-11-08 11:29:25,252 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22890 states, 22889 states have (on average 1.06710647035694) internal successors, (24425), 22889 states have internal predecessors, (24425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:25,271 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22890 states to 22890 states and 24425 transitions.
[2024-11-08 11:29:25,271 INFO  L78                 Accepts]: Start accepts. Automaton has 22890 states and 24425 transitions. Word has length 690
[2024-11-08 11:29:25,272 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:29:25,272 INFO  L471      AbstractCegarLoop]: Abstraction has 22890 states and 24425 transitions.
[2024-11-08 11:29:25,272 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:25,272 INFO  L276                IsEmpty]: Start isEmpty. Operand 22890 states and 24425 transitions.
[2024-11-08 11:29:25,279 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 705
[2024-11-08 11:29:25,280 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:29:25,281 INFO  L215           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, 4, 4, 4, 4, 4, 4, 4, 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, 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]
[2024-11-08 11:29:25,281 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-11-08 11:29:25,282 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:29:25,282 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:29:25,283 INFO  L85        PathProgramCache]: Analyzing trace with hash 715852150, now seen corresponding path program 1 times
[2024-11-08 11:29:25,283 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:29:25,283 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672046305]
[2024-11-08 11:29:25,283 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:29:25,283 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:29:25,353 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:29:25,608 INFO  L134       CoverageAnalysis]: Checked inductivity of 1031 backedges. 684 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked.
[2024-11-08 11:29:25,608 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:29:25,609 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672046305]
[2024-11-08 11:29:25,609 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672046305] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:29:25,609 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 11:29:25,609 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 11:29:25,609 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462431507]
[2024-11-08 11:29:25,609 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:29:25,610 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 11:29:25,610 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:29:25,610 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 11:29:25,610 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-08 11:29:25,611 INFO  L87              Difference]: Start difference. First operand 22890 states and 24425 transitions. Second operand  has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:26,663 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:29:26,663 INFO  L93              Difference]: Finished difference Result 50571 states and 54008 transitions.
[2024-11-08 11:29:26,663 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-08 11:29:26,663 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 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 704
[2024-11-08 11:29:26,664 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:29:26,687 INFO  L225             Difference]: With dead ends: 50571
[2024-11-08 11:29:26,687 INFO  L226             Difference]: Without dead ends: 29181
[2024-11-08 11:29:26,702 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-08 11:29:26,703 INFO  L432           NwaCegarLoop]: 390 mSDtfsCounter, 632 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2024-11-08 11:29:26,703 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 422 Invalid, 1644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1392 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2024-11-08 11:29:26,720 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 29181 states.
[2024-11-08 11:29:26,978 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 29181 to 27983.
[2024-11-08 11:29:26,991 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 27983 states, 27982 states have (on average 1.0520691873347152) internal successors, (29439), 27982 states have internal predecessors, (29439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:27,026 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27983 states to 27983 states and 29439 transitions.
[2024-11-08 11:29:27,027 INFO  L78                 Accepts]: Start accepts. Automaton has 27983 states and 29439 transitions. Word has length 704
[2024-11-08 11:29:27,027 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:29:27,027 INFO  L471      AbstractCegarLoop]: Abstraction has 27983 states and 29439 transitions.
[2024-11-08 11:29:27,028 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:27,028 INFO  L276                IsEmpty]: Start isEmpty. Operand 27983 states and 29439 transitions.
[2024-11-08 11:29:27,039 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 725
[2024-11-08 11:29:27,039 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:29:27,040 INFO  L215           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]
[2024-11-08 11:29:27,040 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-11-08 11:29:27,040 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:29:27,040 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:29:27,040 INFO  L85        PathProgramCache]: Analyzing trace with hash 1177133803, now seen corresponding path program 1 times
[2024-11-08 11:29:27,041 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:29:27,041 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063537129]
[2024-11-08 11:29:27,041 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:29:27,041 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:29:27,156 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:29:27,433 INFO  L134       CoverageAnalysis]: Checked inductivity of 977 backedges. 625 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked.
[2024-11-08 11:29:27,433 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:29:27,433 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063537129]
[2024-11-08 11:29:27,433 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063537129] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:29:27,433 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 11:29:27,433 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 11:29:27,433 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014831862]
[2024-11-08 11:29:27,433 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:29:27,434 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:29:27,434 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:29:27,434 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:29:27,434 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:29:27,435 INFO  L87              Difference]: Start difference. First operand 27983 states and 29439 transitions. Second operand  has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 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)
[2024-11-08 11:29:28,128 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:29:28,128 INFO  L93              Difference]: Finished difference Result 55665 states and 58575 transitions.
[2024-11-08 11:29:28,128 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:29:28,128 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 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
[2024-11-08 11:29:28,129 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:29:28,154 INFO  L225             Difference]: With dead ends: 55665
[2024-11-08 11:29:28,154 INFO  L226             Difference]: Without dead ends: 27983
[2024-11-08 11:29:28,171 INFO  L431           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
[2024-11-08 11:29:28,172 INFO  L432           NwaCegarLoop]: 477 mSDtfsCounter, 226 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-08 11:29:28,172 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 511 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-08 11:29:28,187 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 27983 states.
[2024-11-08 11:29:28,396 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 27983 to 27983.
[2024-11-08 11:29:28,412 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 27983 states, 27982 states have (on average 1.0344864555785862) internal successors, (28947), 27982 states have internal predecessors, (28947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:28,434 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27983 states to 27983 states and 28947 transitions.
[2024-11-08 11:29:28,435 INFO  L78                 Accepts]: Start accepts. Automaton has 27983 states and 28947 transitions. Word has length 724
[2024-11-08 11:29:28,436 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:29:28,436 INFO  L471      AbstractCegarLoop]: Abstraction has 27983 states and 28947 transitions.
[2024-11-08 11:29:28,436 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 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)
[2024-11-08 11:29:28,436 INFO  L276                IsEmpty]: Start isEmpty. Operand 27983 states and 28947 transitions.
[2024-11-08 11:29:28,442 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 727
[2024-11-08 11:29:28,442 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:29:28,442 INFO  L215           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]
[2024-11-08 11:29:28,443 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-11-08 11:29:28,443 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:29:28,443 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:29:28,443 INFO  L85        PathProgramCache]: Analyzing trace with hash 746757208, now seen corresponding path program 1 times
[2024-11-08 11:29:28,443 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:29:28,443 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957347717]
[2024-11-08 11:29:28,443 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:29:28,443 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:29:28,516 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:29:28,654 INFO  L134       CoverageAnalysis]: Checked inductivity of 817 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked.
[2024-11-08 11:29:28,654 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:29:28,654 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957347717]
[2024-11-08 11:29:28,654 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957347717] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 11:29:28,654 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 11:29:28,654 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 11:29:28,655 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379373814]
[2024-11-08 11:29:28,655 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:29:28,655 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:29:28,655 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:29:28,655 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:29:28,656 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 11:29:28,656 INFO  L87              Difference]: Start difference. First operand 27983 states and 28947 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)
[2024-11-08 11:29:29,299 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:29:29,300 INFO  L93              Difference]: Finished difference Result 56256 states and 58223 transitions.
[2024-11-08 11:29:29,300 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:29:29,300 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
[2024-11-08 11:29:29,301 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:29:29,328 INFO  L225             Difference]: With dead ends: 56256
[2024-11-08 11:29:29,328 INFO  L226             Difference]: Without dead ends: 29773
[2024-11-08 11:29:29,341 INFO  L431           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
[2024-11-08 11:29:29,341 INFO  L432           NwaCegarLoop]: 412 mSDtfsCounter, 391 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-08 11:29:29,341 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 431 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-08 11:29:29,354 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 29773 states.
[2024-11-08 11:29:29,574 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 29773 to 15949.
[2024-11-08 11:29:29,581 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15949 states, 15948 states have (on average 1.0338600451467268) internal successors, (16488), 15948 states have internal predecessors, (16488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:29,593 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15949 states to 15949 states and 16488 transitions.
[2024-11-08 11:29:29,593 INFO  L78                 Accepts]: Start accepts. Automaton has 15949 states and 16488 transitions. Word has length 726
[2024-11-08 11:29:29,594 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:29:29,594 INFO  L471      AbstractCegarLoop]: Abstraction has 15949 states and 16488 transitions.
[2024-11-08 11:29:29,594 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)
[2024-11-08 11:29:29,594 INFO  L276                IsEmpty]: Start isEmpty. Operand 15949 states and 16488 transitions.
[2024-11-08 11:29:29,600 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 742
[2024-11-08 11:29:29,600 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:29:29,600 INFO  L215           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]
[2024-11-08 11:29:29,600 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-11-08 11:29:29,600 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:29:29,601 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:29:29,601 INFO  L85        PathProgramCache]: Analyzing trace with hash 1664216047, now seen corresponding path program 1 times
[2024-11-08 11:29:29,601 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:29:29,601 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568796050]
[2024-11-08 11:29:29,601 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:29:29,601 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:29:29,679 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:29:30,371 INFO  L134       CoverageAnalysis]: Checked inductivity of 845 backedges. 631 proven. 26 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked.
[2024-11-08 11:29:30,371 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:29:30,371 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568796050]
[2024-11-08 11:29:30,371 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568796050] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 11:29:30,371 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805004155]
[2024-11-08 11:29:30,371 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:29:30,371 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 11:29:30,372 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 11:29:30,373 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 11:29:30,374 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-11-08 11:29:30,541 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:29:30,542 INFO  L255         TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-08 11:29:30,547 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 11:29:31,006 INFO  L134       CoverageAnalysis]: Checked inductivity of 845 backedges. 581 proven. 76 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked.
[2024-11-08 11:29:31,006 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 11:29:32,105 INFO  L134       CoverageAnalysis]: Checked inductivity of 845 backedges. 506 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked.
[2024-11-08 11:29:32,105 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [805004155] provided 1 perfect and 1 imperfect interpolant sequences
[2024-11-08 11:29:32,105 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2024-11-08 11:29:32,106 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 8
[2024-11-08 11:29:32,106 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587902404]
[2024-11-08 11:29:32,106 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 11:29:32,108 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 11:29:32,108 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:29:32,109 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 11:29:32,109 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-11-08 11:29:32,109 INFO  L87              Difference]: Start difference. First operand 15949 states and 16488 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)
[2024-11-08 11:29:32,889 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:29:32,889 INFO  L93              Difference]: Finished difference Result 34592 states and 35751 transitions.
[2024-11-08 11:29:32,890 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 11:29:32,890 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
[2024-11-08 11:29:32,891 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:29:32,907 INFO  L225             Difference]: With dead ends: 34592
[2024-11-08 11:29:32,907 INFO  L226             Difference]: Without dead ends: 18944
[2024-11-08 11:29:32,917 INFO  L431           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
[2024-11-08 11:29:32,918 INFO  L432           NwaCegarLoop]: 76 mSDtfsCounter, 160 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2024-11-08 11:29:32,918 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 91 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2024-11-08 11:29:32,926 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18944 states.
[2024-11-08 11:29:33,078 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18944 to 17743.
[2024-11-08 11:29:33,087 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17743 states, 17742 states have (on average 1.0322398827640626) internal successors, (18314), 17742 states have internal predecessors, (18314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:33,107 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17743 states to 17743 states and 18314 transitions.
[2024-11-08 11:29:33,108 INFO  L78                 Accepts]: Start accepts. Automaton has 17743 states and 18314 transitions. Word has length 741
[2024-11-08 11:29:33,108 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:29:33,108 INFO  L471      AbstractCegarLoop]: Abstraction has 17743 states and 18314 transitions.
[2024-11-08 11:29:33,109 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)
[2024-11-08 11:29:33,109 INFO  L276                IsEmpty]: Start isEmpty. Operand 17743 states and 18314 transitions.
[2024-11-08 11:29:33,119 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 754
[2024-11-08 11:29:33,120 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:29:33,120 INFO  L215           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]
[2024-11-08 11:29:33,132 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2024-11-08 11:29:33,320 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2024-11-08 11:29:33,321 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:29:33,321 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:29:33,321 INFO  L85        PathProgramCache]: Analyzing trace with hash 1508957717, now seen corresponding path program 1 times
[2024-11-08 11:29:33,321 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:29:33,321 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437132343]
[2024-11-08 11:29:33,321 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:29:33,322 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:29:33,451 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:29:34,544 INFO  L134       CoverageAnalysis]: Checked inductivity of 900 backedges. 598 proven. 106 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked.
[2024-11-08 11:29:34,545 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 11:29:34,545 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437132343]
[2024-11-08 11:29:34,545 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437132343] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 11:29:34,545 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635234436]
[2024-11-08 11:29:34,545 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:29:34,545 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 11:29:34,545 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 11:29:34,547 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 11:29:34,548 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-11-08 11:29:34,734 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 11:29:34,737 INFO  L255         TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 11:29:34,742 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 11:29:35,309 INFO  L134       CoverageAnalysis]: Checked inductivity of 900 backedges. 598 proven. 106 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked.
[2024-11-08 11:29:35,310 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 11:29:37,177 INFO  L134       CoverageAnalysis]: Checked inductivity of 900 backedges. 598 proven. 106 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked.
[2024-11-08 11:29:37,177 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635234436] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 11:29:37,177 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 11:29:37,177 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9
[2024-11-08 11:29:37,177 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757908517]
[2024-11-08 11:29:37,178 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 11:29:37,179 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-08 11:29:37,179 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 11:29:37,180 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-08 11:29:37,180 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2024-11-08 11:29:37,180 INFO  L87              Difference]: Start difference. First operand 17743 states and 18314 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)
[2024-11-08 11:29:41,006 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 11:29:41,006 INFO  L93              Difference]: Finished difference Result 45386 states and 46779 transitions.
[2024-11-08 11:29:41,006 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-11-08 11:29:41,006 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
[2024-11-08 11:29:41,007 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 11:29:41,027 INFO  L225             Difference]: With dead ends: 45386
[2024-11-08 11:29:41,027 INFO  L226             Difference]: Without dead ends: 27944
[2024-11-08 11:29:41,039 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 1515 GetRequests, 1501 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240
[2024-11-08 11:29:41,040 INFO  L432           NwaCegarLoop]: 52 mSDtfsCounter, 2051 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 5966 mSolverCounterSat, 659 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2051 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 6625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 659 IncrementalHoareTripleChecker+Valid, 5966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time
[2024-11-08 11:29:41,040 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [2051 Valid, 314 Invalid, 6625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [659 Valid, 5966 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time]
[2024-11-08 11:29:41,051 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 27944 states.
[2024-11-08 11:29:41,179 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 27944 to 21930.
[2024-11-08 11:29:41,191 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21930 states, 21929 states have (on average 1.0285466733549182) internal successors, (22555), 21929 states have internal predecessors, (22555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 11:29:41,207 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21930 states to 21930 states and 22555 transitions.
[2024-11-08 11:29:41,208 INFO  L78                 Accepts]: Start accepts. Automaton has 21930 states and 22555 transitions. Word has length 753
[2024-11-08 11:29:41,208 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-11-08 11:29:41,208 INFO  L471      AbstractCegarLoop]: Abstraction has 21930 states and 22555 transitions.
[2024-11-08 11:29:41,208 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)
[2024-11-08 11:29:41,208 INFO  L276                IsEmpty]: Start isEmpty. Operand 21930 states and 22555 transitions.
[2024-11-08 11:29:41,215 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 766
[2024-11-08 11:29:41,215 INFO  L207           NwaCegarLoop]: Found error trace
[2024-11-08 11:29:41,215 INFO  L215           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]
[2024-11-08 11:29:41,228 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2024-11-08 11:29:41,415 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 11:29:41,416 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 11:29:41,416 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 11:29:41,416 INFO  L85        PathProgramCache]: Analyzing trace with hash -909543917, now seen corresponding path program 1 times
[2024-11-08 11:29:41,416 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 11:29:41,416 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280344669]
[2024-11-08 11:29:41,417 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 11:29:41,417 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 11:29:41,542 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 11:29:41,542 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 11:29:41,615 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 11:29:41,702 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 11:29:41,703 INFO  L325         BasicCegarLoop]: Counterexample is feasible
[2024-11-08 11:29:41,703 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-08 11:29:41,705 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-11-08 11:29:41,707 INFO  L407         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 11:29:41,872 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 11:29:41,874 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:29:41 BoogieIcfgContainer
[2024-11-08 11:29:41,874 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 11:29:41,874 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 11:29:41,875 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-08 11:29:41,875 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-08 11:29:41,875 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:28:56" (3/4) ...
[2024-11-08 11:29:41,876 INFO  L136         WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-08 11:29:42,064 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-08 11:29:42,064 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 11:29:42,065 INFO  L158              Benchmark]: Toolchain (without parser) took 48164.83ms. Allocated memory was 205.5MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 128.0MB in the beginning and 818.9MB in the end (delta: -691.0MB). Peak memory consumption was 875.2MB. Max. memory is 16.1GB.
[2024-11-08 11:29:42,066 INFO  L158              Benchmark]: CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory is still 69.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 11:29:42,066 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 687.29ms. Allocated memory is still 205.5MB. Free memory was 127.8MB in the beginning and 103.8MB in the end (delta: 24.0MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB.
[2024-11-08 11:29:42,066 INFO  L158              Benchmark]: Boogie Procedure Inliner took 146.43ms. Allocated memory is still 205.5MB. Free memory was 103.8MB in the beginning and 65.6MB in the end (delta: 38.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB.
[2024-11-08 11:29:42,066 INFO  L158              Benchmark]: Boogie Preprocessor took 255.40ms. Allocated memory is still 205.5MB. Free memory was 65.6MB in the beginning and 96.6MB in the end (delta: -31.0MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB.
[2024-11-08 11:29:42,066 INFO  L158              Benchmark]: RCFGBuilder took 1872.02ms. Allocated memory was 205.5MB in the beginning and 350.2MB in the end (delta: 144.7MB). Free memory was 96.6MB in the beginning and 151.2MB in the end (delta: -54.6MB). Peak memory consumption was 102.2MB. Max. memory is 16.1GB.
[2024-11-08 11:29:42,069 INFO  L158              Benchmark]: TraceAbstraction took 45008.52ms. Allocated memory was 350.2MB in the beginning and 1.8GB in the end (delta: 1.4GB). Free memory was 151.2MB in the beginning and 878.7MB in the end (delta: -727.5MB). Peak memory consumption was 694.4MB. Max. memory is 16.1GB.
[2024-11-08 11:29:42,069 INFO  L158              Benchmark]: Witness Printer took 189.35ms. Allocated memory is still 1.8GB. Free memory was 878.7MB in the beginning and 818.9MB in the end (delta: 59.8MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB.
[2024-11-08 11:29:42,070 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.14ms. Allocated memory is still 111.1MB. Free memory is still 69.0MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 687.29ms. Allocated memory is still 205.5MB. Free memory was 127.8MB in the beginning and 103.8MB in the end (delta: 24.0MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 146.43ms. Allocated memory is still 205.5MB. Free memory was 103.8MB in the beginning and 65.6MB in the end (delta: 38.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 255.40ms. Allocated memory is still 205.5MB. Free memory was 65.6MB in the beginning and 96.6MB in the end (delta: -31.0MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1872.02ms. Allocated memory was 205.5MB in the beginning and 350.2MB in the end (delta: 144.7MB). Free memory was 96.6MB in the beginning and 151.2MB in the end (delta: -54.6MB). Peak memory consumption was 102.2MB. Max. memory is 16.1GB.
 * TraceAbstraction took 45008.52ms. Allocated memory was 350.2MB in the beginning and 1.8GB in the end (delta: 1.4GB). Free memory was 151.2MB in the beginning and 878.7MB in the end (delta: -727.5MB). Peak memory consumption was 694.4MB. Max. memory is 16.1GB.
 * Witness Printer took 189.35ms. Allocated memory is still 1.8GB. Free memory was 878.7MB in the beginning and 818.9MB in the end (delta: 59.8MB). Peak memory consumption was 58.7MB. 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=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=-366667, a29=340350, a2=4, a4=-562500, 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=-366667, a29=340350, a2=4, a4=-562500, 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=-366667, a29=340350, a2=4, a4=-562500, 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=-366667, a29=340350, a2=4, a4=-562500, 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=-366667, a29=340350, a2=4, a4=-562500, 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=-366667, a29=340350, a2=4, a4=-562500, 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=-366667, a29=340350, a2=4, a4=-562500, 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=-366667, a29=340350, a2=4, a4=-562500, input=5, 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=5, 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=5, 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.8s, OverallIterations: 20, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 25.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10124 SdHoareTripleChecker+Valid, 23.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10124 mSDsluCounter, 6169 SdHoareTripleChecker+Invalid, 19.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1082 mSDsCounter, 4364 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27653 IncrementalHoareTripleChecker+Invalid, 32017 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4364 mSolverCounterUnsat, 5087 mSDtfsCounter, 27653 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5532 GetRequests, 5467 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27983occurred in iteration=15, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 35161 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 13004 NumberOfCodeBlocks, 13004 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 14246 ConstructedInterpolants, 0 QuantifiedInterpolants, 65164 SizeOfPredicates, 6 NumberOfNonLiveVariables, 4188 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 29 InterpolantComputations, 17 PerfectInterpolantSequences, 13176/13837 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
RESULT: Ultimate proved your program to be incorrect!
[2024-11-08 11:29:42,120 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/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