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


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


Checking for ERROR reachability
Using default analysis
Version 4e77c044
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label41.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt --witnessprinter.witness.filename witness.graphml --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 17adff61a53ebdf07d4a3b79cee4969460f225fe
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE
--- Real Ultimate output ---
This is Ultimate 0.2.1-dev-4e77c04
[2021-10-12 23:59:05,968 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-10-12 23:59:05,971 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-10-12 23:59:06,024 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-10-12 23:59:06,025 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-10-12 23:59:06,029 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-10-12 23:59:06,031 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-10-12 23:59:06,035 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-10-12 23:59:06,037 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-10-12 23:59:06,043 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-10-12 23:59:06,044 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-10-12 23:59:06,045 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-10-12 23:59:06,046 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-10-12 23:59:06,048 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-10-12 23:59:06,050 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-10-12 23:59:06,058 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-10-12 23:59:06,060 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-10-12 23:59:06,061 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-10-12 23:59:06,063 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-10-12 23:59:06,070 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-10-12 23:59:06,072 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-10-12 23:59:06,073 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-10-12 23:59:06,076 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-10-12 23:59:06,077 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-10-12 23:59:06,085 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-10-12 23:59:06,086 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-10-12 23:59:06,086 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-10-12 23:59:06,088 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-10-12 23:59:06,089 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-10-12 23:59:06,090 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-10-12 23:59:06,091 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-10-12 23:59:06,091 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-10-12 23:59:06,094 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-10-12 23:59:06,095 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-10-12 23:59:06,096 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-10-12 23:59:06,097 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-10-12 23:59:06,097 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-10-12 23:59:06,098 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-10-12 23:59:06,098 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-10-12 23:59:06,099 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-10-12 23:59:06,100 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-10-12 23:59:06,101 INFO  L101        SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf
[2021-10-12 23:59:06,140 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-10-12 23:59:06,140 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-10-12 23:59:06,153 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-10-12 23:59:06,153 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-10-12 23:59:06,155 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-10-12 23:59:06,155 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-10-12 23:59:06,155 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-10-12 23:59:06,155 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-10-12 23:59:06,156 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-10-12 23:59:06,156 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-10-12 23:59:06,157 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-10-12 23:59:06,157 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-10-12 23:59:06,157 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-10-12 23:59:06,157 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-10-12 23:59:06,158 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-10-12 23:59:06,158 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-10-12 23:59:06,158 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-10-12 23:59:06,158 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-10-12 23:59:06,158 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-10-12 23:59:06,159 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-10-12 23:59:06,159 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-10-12 23:59:06,159 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-10-12 23:59:06,159 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-10-12 23:59:06,160 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-10-12 23:59:06,160 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-10-12 23:59:06,160 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-10-12 23:59:06,160 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-10-12 23:59:06,160 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-10-12 23:59:06,161 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-10-12 23:59:06,162 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2021-10-12 23:59:06,162 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
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 -> 17adff61a53ebdf07d4a3b79cee4969460f225fe
[2021-10-12 23:59:06,412 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-10-12 23:59:06,432 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-10-12 23:59:06,434 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-10-12 23:59:06,435 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-10-12 23:59:06,438 INFO  L275        PluginConnector]: CDTParser initialized
[2021-10-12 23:59:06,439 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/eca-rers2012/Problem15_label41.c
[2021-10-12 23:59:06,505 INFO  L220              CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/data/387df873e/62bb2b1975d94da7b98c6339e7aa65f2/FLAG97f1a9c5d
[2021-10-12 23:59:07,124 INFO  L306              CDTParser]: Found 1 translation units.
[2021-10-12 23:59:07,124 INFO  L160              CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/sv-benchmarks/c/eca-rers2012/Problem15_label41.c
[2021-10-12 23:59:07,141 INFO  L349              CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/data/387df873e/62bb2b1975d94da7b98c6339e7aa65f2/FLAG97f1a9c5d
[2021-10-12 23:59:07,312 INFO  L357              CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/data/387df873e/62bb2b1975d94da7b98c6339e7aa65f2
[2021-10-12 23:59:07,314 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-10-12 23:59:07,316 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2021-10-12 23:59:07,318 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-10-12 23:59:07,318 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-10-12 23:59:07,322 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-10-12 23:59:07,322 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:59:07" (1/1) ...
[2021-10-12 23:59:07,323 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59b5e9ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:07, skipping insertion in model container
[2021-10-12 23:59:07,324 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:59:07" (1/1) ...
[2021-10-12 23:59:07,330 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-10-12 23:59:07,425 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-10-12 23:59:07,724 WARN  L228   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/sv-benchmarks/c/eca-rers2012/Problem15_label41.c[3200,3213]
[2021-10-12 23:59:08,321 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-10-12 23:59:08,331 INFO  L203         MainTranslator]: Completed pre-run
[2021-10-12 23:59:08,366 WARN  L228   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/sv-benchmarks/c/eca-rers2012/Problem15_label41.c[3200,3213]
[2021-10-12 23:59:08,726 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-10-12 23:59:08,743 INFO  L208         MainTranslator]: Completed translation
[2021-10-12 23:59:08,743 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:08 WrapperNode
[2021-10-12 23:59:08,745 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-10-12 23:59:08,746 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-10-12 23:59:08,746 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-10-12 23:59:08,747 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-10-12 23:59:08,754 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:08" (1/1) ...
[2021-10-12 23:59:08,794 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:08" (1/1) ...
[2021-10-12 23:59:08,989 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-10-12 23:59:08,990 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-10-12 23:59:08,990 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-10-12 23:59:08,990 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-10-12 23:59:08,998 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:08" (1/1) ...
[2021-10-12 23:59:08,999 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:08" (1/1) ...
[2021-10-12 23:59:09,020 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:08" (1/1) ...
[2021-10-12 23:59:09,020 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:08" (1/1) ...
[2021-10-12 23:59:09,161 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:08" (1/1) ...
[2021-10-12 23:59:09,187 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:08" (1/1) ...
[2021-10-12 23:59:09,205 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:08" (1/1) ...
[2021-10-12 23:59:09,224 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-10-12 23:59:09,227 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-10-12 23:59:09,227 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-10-12 23:59:09,227 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-10-12 23:59:09,228 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:08" (1/1) ...
[2021-10-12 23:59:09,236 INFO  L170          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-10-12 23:59:09,250 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/z3
[2021-10-12 23:59:09,262 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2021-10-12 23:59:09,328 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2021-10-12 23:59:09,338 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-10-12 23:59:09,338 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-10-12 23:59:09,339 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-10-12 23:59:09,339 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-10-12 23:59:12,451 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-10-12 23:59:12,452 INFO  L299             CfgBuilder]: Removed 9 assume(true) statements.
[2021-10-12 23:59:12,455 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:59:12 BoogieIcfgContainer
[2021-10-12 23:59:12,455 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-10-12 23:59:12,458 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-10-12 23:59:12,458 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-10-12 23:59:12,461 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-10-12 23:59:12,461 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:59:07" (1/3) ...
[2021-10-12 23:59:12,462 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e5538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:59:12, skipping insertion in model container
[2021-10-12 23:59:12,462 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:59:08" (2/3) ...
[2021-10-12 23:59:12,463 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e5538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:59:12, skipping insertion in model container
[2021-10-12 23:59:12,463 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:59:12" (3/3) ...
[2021-10-12 23:59:12,464 INFO  L111   eAbstractionObserver]: Analyzing ICFG Problem15_label41.c
[2021-10-12 23:59:12,473 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-10-12 23:59:12,473 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2021-10-12 23:59:12,539 INFO  L338      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2021-10-12 23:59:12,548 INFO  L339      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, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR
[2021-10-12 23:59:12,549 INFO  L340      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-10-12 23:59:12,583 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)
[2021-10-12 23:59:12,588 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2021-10-12 23:59:12,589 INFO  L504         BasicCegarLoop]: Found error trace
[2021-10-12 23:59:12,589 INFO  L512         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-12 23:59:12,590 INFO  L402      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-12 23:59:12,595 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-12 23:59:12,595 INFO  L82        PathProgramCache]: Analyzing trace with hash -1225036359, now seen corresponding path program 1 times
[2021-10-12 23:59:12,613 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-12 23:59:12,615 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134071210]
[2021-10-12 23:59:12,616 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-12 23:59:12,617 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-12 23:59:12,756 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-12 23:59:12,892 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-12 23:59:12,893 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-12 23:59:12,893 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134071210]
[2021-10-12 23:59:12,894 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134071210] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-12 23:59:12,894 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-12 23:59:12,895 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-12 23:59:12,897 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874625898]
[2021-10-12 23:59:12,902 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-12 23:59:12,902 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-12 23:59:12,917 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-12 23:59:12,918 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:12,922 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 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:15,603 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-12 23:59:15,603 INFO  L93              Difference]: Finished difference Result 1154 states and 2106 transitions.
[2021-10-12 23:59:15,604 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-12 23:59:15,605 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 25
[2021-10-12 23:59:15,605 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-12 23:59:15,622 INFO  L225             Difference]: With dead ends: 1154
[2021-10-12 23:59:15,622 INFO  L226             Difference]: Without dead ends: 665
[2021-10-12 23:59:15,627 INFO  L781         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:15,645 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 665 states.
[2021-10-12 23:59:15,696 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663.
[2021-10-12 23:59:15,699 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 663 states, 662 states have (on average 1.4818731117824773) internal successors, (981), 662 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:15,702 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 981 transitions.
[2021-10-12 23:59:15,704 INFO  L78                 Accepts]: Start accepts. Automaton has 663 states and 981 transitions. Word has length 25
[2021-10-12 23:59:15,704 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-12 23:59:15,704 INFO  L470      AbstractCegarLoop]: Abstraction has 663 states and 981 transitions.
[2021-10-12 23:59:15,704 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:15,705 INFO  L276                IsEmpty]: Start isEmpty. Operand 663 states and 981 transitions.
[2021-10-12 23:59:15,708 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2021-10-12 23:59:15,708 INFO  L504         BasicCegarLoop]: Found error trace
[2021-10-12 23:59:15,709 INFO  L512         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-12 23:59:15,709 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-10-12 23:59:15,709 INFO  L402      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-12 23:59:15,710 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-12 23:59:15,710 INFO  L82        PathProgramCache]: Analyzing trace with hash -2028714209, now seen corresponding path program 1 times
[2021-10-12 23:59:15,710 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-12 23:59:15,711 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621318049]
[2021-10-12 23:59:15,711 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-12 23:59:15,711 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-12 23:59:15,759 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-12 23:59:15,865 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-12 23:59:15,865 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-12 23:59:15,866 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621318049]
[2021-10-12 23:59:15,866 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621318049] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-12 23:59:15,866 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-12 23:59:15,866 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-12 23:59:15,866 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037969467]
[2021-10-12 23:59:15,868 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-12 23:59:15,868 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-12 23:59:15,869 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-12 23:59:15,869 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:15,869 INFO  L87              Difference]: Start difference. First operand 663 states and 981 transitions. Second operand  has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:17,707 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-12 23:59:17,707 INFO  L93              Difference]: Finished difference Result 1624 states and 2315 transitions.
[2021-10-12 23:59:17,708 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-12 23:59:17,708 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 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 90
[2021-10-12 23:59:17,709 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-12 23:59:17,714 INFO  L225             Difference]: With dead ends: 1624
[2021-10-12 23:59:17,714 INFO  L226             Difference]: Without dead ends: 963
[2021-10-12 23:59:17,717 INFO  L781         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:17,719 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 963 states.
[2021-10-12 23:59:17,764 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963.
[2021-10-12 23:59:17,766 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 963 states, 962 states have (on average 1.362785862785863) internal successors, (1311), 962 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:17,770 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1311 transitions.
[2021-10-12 23:59:17,771 INFO  L78                 Accepts]: Start accepts. Automaton has 963 states and 1311 transitions. Word has length 90
[2021-10-12 23:59:17,771 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-12 23:59:17,771 INFO  L470      AbstractCegarLoop]: Abstraction has 963 states and 1311 transitions.
[2021-10-12 23:59:17,772 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:17,772 INFO  L276                IsEmpty]: Start isEmpty. Operand 963 states and 1311 transitions.
[2021-10-12 23:59:17,775 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2021-10-12 23:59:17,775 INFO  L504         BasicCegarLoop]: Found error trace
[2021-10-12 23:59:17,776 INFO  L512         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-12 23:59:17,776 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-10-12 23:59:17,776 INFO  L402      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-12 23:59:17,777 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-12 23:59:17,777 INFO  L82        PathProgramCache]: Analyzing trace with hash 972286478, now seen corresponding path program 1 times
[2021-10-12 23:59:17,777 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-12 23:59:17,777 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978964811]
[2021-10-12 23:59:17,778 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-12 23:59:17,778 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-12 23:59:17,811 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-12 23:59:17,872 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-12 23:59:17,873 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-12 23:59:17,873 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978964811]
[2021-10-12 23:59:17,873 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978964811] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-12 23:59:17,873 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-12 23:59:17,874 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-12 23:59:17,874 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723520980]
[2021-10-12 23:59:17,874 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-12 23:59:17,875 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-12 23:59:17,875 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-12 23:59:17,875 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:17,876 INFO  L87              Difference]: Start difference. First operand 963 states and 1311 transitions. Second operand  has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:19,704 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-12 23:59:19,705 INFO  L93              Difference]: Finished difference Result 2229 states and 3186 transitions.
[2021-10-12 23:59:19,706 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-12 23:59:19,706 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 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 95
[2021-10-12 23:59:19,707 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-12 23:59:19,715 INFO  L225             Difference]: With dead ends: 2229
[2021-10-12 23:59:19,716 INFO  L226             Difference]: Without dead ends: 1567
[2021-10-12 23:59:19,717 INFO  L781         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:19,719 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1567 states.
[2021-10-12 23:59:19,744 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1266.
[2021-10-12 23:59:19,746 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1266 states, 1265 states have (on average 1.3051383399209486) internal successors, (1651), 1265 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:19,752 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1651 transitions.
[2021-10-12 23:59:19,752 INFO  L78                 Accepts]: Start accepts. Automaton has 1266 states and 1651 transitions. Word has length 95
[2021-10-12 23:59:19,753 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-12 23:59:19,753 INFO  L470      AbstractCegarLoop]: Abstraction has 1266 states and 1651 transitions.
[2021-10-12 23:59:19,753 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:19,753 INFO  L276                IsEmpty]: Start isEmpty. Operand 1266 states and 1651 transitions.
[2021-10-12 23:59:19,756 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2021-10-12 23:59:19,756 INFO  L504         BasicCegarLoop]: Found error trace
[2021-10-12 23:59:19,756 INFO  L512         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-12 23:59:19,756 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-10-12 23:59:19,757 INFO  L402      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-12 23:59:19,757 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-12 23:59:19,757 INFO  L82        PathProgramCache]: Analyzing trace with hash 1042225838, now seen corresponding path program 1 times
[2021-10-12 23:59:19,758 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-12 23:59:19,758 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280599627]
[2021-10-12 23:59:19,758 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-12 23:59:19,759 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-12 23:59:19,789 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-12 23:59:19,903 INFO  L134       CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-12 23:59:19,903 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-12 23:59:19,904 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280599627]
[2021-10-12 23:59:19,904 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280599627] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-12 23:59:19,904 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-12 23:59:19,908 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-12 23:59:19,908 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420218378]
[2021-10-12 23:59:19,909 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2021-10-12 23:59:19,909 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-12 23:59:19,910 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-12 23:59:19,910 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2021-10-12 23:59:19,910 INFO  L87              Difference]: Start difference. First operand 1266 states and 1651 transitions. Second operand  has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:24,158 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-12 23:59:24,159 INFO  L93              Difference]: Finished difference Result 4668 states and 6173 transitions.
[2021-10-12 23:59:24,159 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2021-10-12 23:59:24,160 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 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 116
[2021-10-12 23:59:24,163 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-12 23:59:24,181 INFO  L225             Difference]: With dead ends: 4668
[2021-10-12 23:59:24,182 INFO  L226             Difference]: Without dead ends: 3404
[2021-10-12 23:59:24,186 INFO  L781         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2021-10-12 23:59:24,190 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3404 states.
[2021-10-12 23:59:24,254 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 3381.
[2021-10-12 23:59:24,261 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3381 states, 3380 states have (on average 1.2366863905325445) internal successors, (4180), 3380 states have internal predecessors, (4180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:24,270 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4180 transitions.
[2021-10-12 23:59:24,271 INFO  L78                 Accepts]: Start accepts. Automaton has 3381 states and 4180 transitions. Word has length 116
[2021-10-12 23:59:24,272 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-12 23:59:24,272 INFO  L470      AbstractCegarLoop]: Abstraction has 3381 states and 4180 transitions.
[2021-10-12 23:59:24,273 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 29.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:24,273 INFO  L276                IsEmpty]: Start isEmpty. Operand 3381 states and 4180 transitions.
[2021-10-12 23:59:24,283 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 185
[2021-10-12 23:59:24,283 INFO  L504         BasicCegarLoop]: Found error trace
[2021-10-12 23:59:24,283 INFO  L512         BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-12 23:59:24,284 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-10-12 23:59:24,284 INFO  L402      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-12 23:59:24,285 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-12 23:59:24,286 INFO  L82        PathProgramCache]: Analyzing trace with hash 696213150, now seen corresponding path program 1 times
[2021-10-12 23:59:24,286 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-12 23:59:24,286 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470383414]
[2021-10-12 23:59:24,287 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-12 23:59:24,287 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-12 23:59:24,335 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-12 23:59:24,514 INFO  L134       CoverageAnalysis]: Checked inductivity of 112 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked.
[2021-10-12 23:59:24,514 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-12 23:59:24,514 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470383414]
[2021-10-12 23:59:24,515 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470383414] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-12 23:59:24,515 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-12 23:59:24,515 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-12 23:59:24,515 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888862359]
[2021-10-12 23:59:24,516 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-12 23:59:24,517 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-12 23:59:24,517 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-12 23:59:24,518 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:24,518 INFO  L87              Difference]: Start difference. First operand 3381 states and 4180 transitions. Second operand  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:26,163 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-12 23:59:26,163 INFO  L93              Difference]: Finished difference Result 8563 states and 10754 transitions.
[2021-10-12 23:59:26,164 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-12 23:59:26,164 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 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 184
[2021-10-12 23:59:26,164 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-12 23:59:26,192 INFO  L225             Difference]: With dead ends: 8563
[2021-10-12 23:59:26,192 INFO  L226             Difference]: Without dead ends: 5483
[2021-10-12 23:59:26,197 INFO  L781         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:26,203 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5483 states.
[2021-10-12 23:59:26,300 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5478.
[2021-10-12 23:59:26,311 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5478 states, 5477 states have (on average 1.16870549570933) internal successors, (6401), 5477 states have internal predecessors, (6401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:26,323 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6401 transitions.
[2021-10-12 23:59:26,323 INFO  L78                 Accepts]: Start accepts. Automaton has 5478 states and 6401 transitions. Word has length 184
[2021-10-12 23:59:26,324 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-12 23:59:26,324 INFO  L470      AbstractCegarLoop]: Abstraction has 5478 states and 6401 transitions.
[2021-10-12 23:59:26,324 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:26,324 INFO  L276                IsEmpty]: Start isEmpty. Operand 5478 states and 6401 transitions.
[2021-10-12 23:59:26,329 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 287
[2021-10-12 23:59:26,330 INFO  L504         BasicCegarLoop]: Found error trace
[2021-10-12 23:59:26,330 INFO  L512         BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-12 23:59:26,330 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-10-12 23:59:26,331 INFO  L402      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-12 23:59:26,331 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-12 23:59:26,331 INFO  L82        PathProgramCache]: Analyzing trace with hash 1458290064, now seen corresponding path program 1 times
[2021-10-12 23:59:26,332 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-12 23:59:26,332 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288265692]
[2021-10-12 23:59:26,332 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-12 23:59:26,332 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-12 23:59:26,387 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-12 23:59:26,525 INFO  L134       CoverageAnalysis]: Checked inductivity of 109 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked.
[2021-10-12 23:59:26,525 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-12 23:59:26,525 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288265692]
[2021-10-12 23:59:26,526 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288265692] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-12 23:59:26,526 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-12 23:59:26,526 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-12 23:59:26,527 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233802396]
[2021-10-12 23:59:26,527 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-12 23:59:26,528 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-12 23:59:26,528 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-12 23:59:26,528 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:26,529 INFO  L87              Difference]: Start difference. First operand 5478 states and 6401 transitions. Second operand  has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:28,011 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-12 23:59:28,011 INFO  L93              Difference]: Finished difference Result 10655 states and 12489 transitions.
[2021-10-12 23:59:28,012 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-12 23:59:28,013 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 286
[2021-10-12 23:59:28,013 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-12 23:59:28,038 INFO  L225             Difference]: With dead ends: 10655
[2021-10-12 23:59:28,038 INFO  L226             Difference]: Without dead ends: 5478
[2021-10-12 23:59:28,044 INFO  L781         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:28,051 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5478 states.
[2021-10-12 23:59:28,150 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5478 to 5478.
[2021-10-12 23:59:28,161 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5478 states, 5477 states have (on average 1.1676100054774512) internal successors, (6395), 5477 states have internal predecessors, (6395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:28,174 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6395 transitions.
[2021-10-12 23:59:28,174 INFO  L78                 Accepts]: Start accepts. Automaton has 5478 states and 6395 transitions. Word has length 286
[2021-10-12 23:59:28,175 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-12 23:59:28,176 INFO  L470      AbstractCegarLoop]: Abstraction has 5478 states and 6395 transitions.
[2021-10-12 23:59:28,176 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:28,176 INFO  L276                IsEmpty]: Start isEmpty. Operand 5478 states and 6395 transitions.
[2021-10-12 23:59:28,182 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 313
[2021-10-12 23:59:28,182 INFO  L504         BasicCegarLoop]: Found error trace
[2021-10-12 23:59:28,182 INFO  L512         BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-12 23:59:28,183 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-10-12 23:59:28,183 INFO  L402      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-12 23:59:28,183 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-12 23:59:28,184 INFO  L82        PathProgramCache]: Analyzing trace with hash 407211933, now seen corresponding path program 1 times
[2021-10-12 23:59:28,184 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-12 23:59:28,188 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946820454]
[2021-10-12 23:59:28,189 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-12 23:59:28,189 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-12 23:59:28,262 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-12 23:59:28,366 INFO  L134       CoverageAnalysis]: Checked inductivity of 135 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked.
[2021-10-12 23:59:28,366 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-12 23:59:28,366 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946820454]
[2021-10-12 23:59:28,367 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946820454] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-12 23:59:28,367 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-12 23:59:28,368 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-12 23:59:28,368 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461430302]
[2021-10-12 23:59:28,368 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-12 23:59:28,369 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-12 23:59:28,369 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-12 23:59:28,369 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:28,370 INFO  L87              Difference]: Start difference. First operand 5478 states and 6395 transitions. Second operand  has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:30,465 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-12 23:59:30,466 INFO  L93              Difference]: Finished difference Result 12758 states and 15193 transitions.
[2021-10-12 23:59:30,468 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-12 23:59:30,468 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 312
[2021-10-12 23:59:30,469 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-12 23:59:30,503 INFO  L225             Difference]: With dead ends: 12758
[2021-10-12 23:59:30,503 INFO  L226             Difference]: Without dead ends: 7581
[2021-10-12 23:59:30,508 INFO  L781         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:30,516 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7581 states.
[2021-10-12 23:59:30,633 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7581 to 7579.
[2021-10-12 23:59:30,647 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7579 states, 7578 states have (on average 1.1421219319081553) internal successors, (8655), 7578 states have internal predecessors, (8655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:30,662 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7579 states to 7579 states and 8655 transitions.
[2021-10-12 23:59:30,662 INFO  L78                 Accepts]: Start accepts. Automaton has 7579 states and 8655 transitions. Word has length 312
[2021-10-12 23:59:30,663 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-12 23:59:30,663 INFO  L470      AbstractCegarLoop]: Abstraction has 7579 states and 8655 transitions.
[2021-10-12 23:59:30,663 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:30,663 INFO  L276                IsEmpty]: Start isEmpty. Operand 7579 states and 8655 transitions.
[2021-10-12 23:59:30,671 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 372
[2021-10-12 23:59:30,671 INFO  L504         BasicCegarLoop]: Found error trace
[2021-10-12 23:59:30,671 INFO  L512         BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-12 23:59:30,672 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-10-12 23:59:30,672 INFO  L402      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-12 23:59:30,673 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-12 23:59:30,673 INFO  L82        PathProgramCache]: Analyzing trace with hash -1495621414, now seen corresponding path program 1 times
[2021-10-12 23:59:30,673 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-12 23:59:30,673 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752353572]
[2021-10-12 23:59:30,673 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-12 23:59:30,674 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-12 23:59:30,740 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-12 23:59:30,849 INFO  L134       CoverageAnalysis]: Checked inductivity of 120 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked.
[2021-10-12 23:59:30,849 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-12 23:59:30,849 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752353572]
[2021-10-12 23:59:30,849 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752353572] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-12 23:59:30,850 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-12 23:59:30,850 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-12 23:59:30,850 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703941186]
[2021-10-12 23:59:30,851 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-12 23:59:30,851 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-12 23:59:30,852 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-12 23:59:30,852 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:30,852 INFO  L87              Difference]: Start difference. First operand 7579 states and 8655 transitions. Second operand  has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:33,010 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-12 23:59:33,010 INFO  L93              Difference]: Finished difference Result 16956 states and 19716 transitions.
[2021-10-12 23:59:33,012 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-12 23:59:33,013 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 371
[2021-10-12 23:59:33,014 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-12 23:59:33,060 INFO  L225             Difference]: With dead ends: 16956
[2021-10-12 23:59:33,060 INFO  L226             Difference]: Without dead ends: 9678
[2021-10-12 23:59:33,067 INFO  L781         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:33,078 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9678 states.
[2021-10-12 23:59:33,234 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9678 to 8781.
[2021-10-12 23:59:33,264 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8781 states, 8780 states have (on average 1.1329157175398634) internal successors, (9947), 8780 states have internal predecessors, (9947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:33,281 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8781 states to 8781 states and 9947 transitions.
[2021-10-12 23:59:33,281 INFO  L78                 Accepts]: Start accepts. Automaton has 8781 states and 9947 transitions. Word has length 371
[2021-10-12 23:59:33,282 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-12 23:59:33,282 INFO  L470      AbstractCegarLoop]: Abstraction has 8781 states and 9947 transitions.
[2021-10-12 23:59:33,283 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:33,283 INFO  L276                IsEmpty]: Start isEmpty. Operand 8781 states and 9947 transitions.
[2021-10-12 23:59:33,292 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 373
[2021-10-12 23:59:33,292 INFO  L504         BasicCegarLoop]: Found error trace
[2021-10-12 23:59:33,293 INFO  L512         BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-12 23:59:33,293 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-10-12 23:59:33,293 INFO  L402      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-12 23:59:33,294 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-12 23:59:33,294 INFO  L82        PathProgramCache]: Analyzing trace with hash 1065923684, now seen corresponding path program 1 times
[2021-10-12 23:59:33,294 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-12 23:59:33,295 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257648207]
[2021-10-12 23:59:33,295 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-12 23:59:33,295 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-12 23:59:33,388 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-12 23:59:33,583 INFO  L134       CoverageAnalysis]: Checked inductivity of 109 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked.
[2021-10-12 23:59:33,583 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-12 23:59:33,584 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257648207]
[2021-10-12 23:59:33,584 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257648207] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-12 23:59:33,584 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-12 23:59:33,584 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-12 23:59:33,584 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529622496]
[2021-10-12 23:59:33,585 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-12 23:59:33,585 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-12 23:59:33,586 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-12 23:59:33,586 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:33,587 INFO  L87              Difference]: Start difference. First operand 8781 states and 9947 transitions. Second operand  has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:35,620 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-12 23:59:35,620 INFO  L93              Difference]: Finished difference Result 22652 states and 25700 transitions.
[2021-10-12 23:59:35,624 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-12 23:59:35,625 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 372
[2021-10-12 23:59:35,626 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-12 23:59:35,646 INFO  L225             Difference]: With dead ends: 22652
[2021-10-12 23:59:35,647 INFO  L226             Difference]: Without dead ends: 11182
[2021-10-12 23:59:35,658 INFO  L781         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:35,668 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11182 states.
[2021-10-12 23:59:35,839 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11182 to 11182.
[2021-10-12 23:59:35,854 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11182 states, 11181 states have (on average 1.0889902513192022) internal successors, (12176), 11181 states have internal predecessors, (12176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:35,870 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11182 states to 11182 states and 12176 transitions.
[2021-10-12 23:59:35,872 INFO  L78                 Accepts]: Start accepts. Automaton has 11182 states and 12176 transitions. Word has length 372
[2021-10-12 23:59:35,872 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-12 23:59:35,873 INFO  L470      AbstractCegarLoop]: Abstraction has 11182 states and 12176 transitions.
[2021-10-12 23:59:35,873 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:35,873 INFO  L276                IsEmpty]: Start isEmpty. Operand 11182 states and 12176 transitions.
[2021-10-12 23:59:35,880 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 389
[2021-10-12 23:59:35,881 INFO  L504         BasicCegarLoop]: Found error trace
[2021-10-12 23:59:35,881 INFO  L512         BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-12 23:59:35,881 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-10-12 23:59:35,882 INFO  L402      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-12 23:59:35,882 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-12 23:59:35,882 INFO  L82        PathProgramCache]: Analyzing trace with hash -596690605, now seen corresponding path program 1 times
[2021-10-12 23:59:35,883 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-12 23:59:35,884 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512795813]
[2021-10-12 23:59:35,884 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-12 23:59:35,884 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-12 23:59:35,956 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-12 23:59:36,074 INFO  L134       CoverageAnalysis]: Checked inductivity of 125 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-12 23:59:36,074 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-12 23:59:36,074 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512795813]
[2021-10-12 23:59:36,075 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512795813] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-12 23:59:36,075 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-12 23:59:36,075 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-12 23:59:36,079 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327209610]
[2021-10-12 23:59:36,081 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-12 23:59:36,081 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-12 23:59:36,082 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-12 23:59:36,082 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:36,082 INFO  L87              Difference]: Start difference. First operand 11182 states and 12176 transitions. Second operand  has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:37,611 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-12 23:59:37,611 INFO  L93              Difference]: Finished difference Result 23867 states and 26332 transitions.
[2021-10-12 23:59:37,612 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-12 23:59:37,612 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 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 388
[2021-10-12 23:59:37,613 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-12 23:59:37,635 INFO  L225             Difference]: With dead ends: 23867
[2021-10-12 23:59:37,635 INFO  L226             Difference]: Without dead ends: 12986
[2021-10-12 23:59:37,645 INFO  L781         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:37,658 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12986 states.
[2021-10-12 23:59:37,852 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12986 to 12080.
[2021-10-12 23:59:37,868 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12080 states, 12079 states have (on average 1.0866793608742447) internal successors, (13126), 12079 states have internal predecessors, (13126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:37,884 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12080 states to 12080 states and 13126 transitions.
[2021-10-12 23:59:37,884 INFO  L78                 Accepts]: Start accepts. Automaton has 12080 states and 13126 transitions. Word has length 388
[2021-10-12 23:59:37,885 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-12 23:59:37,885 INFO  L470      AbstractCegarLoop]: Abstraction has 12080 states and 13126 transitions.
[2021-10-12 23:59:37,886 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:37,886 INFO  L276                IsEmpty]: Start isEmpty. Operand 12080 states and 13126 transitions.
[2021-10-12 23:59:37,899 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 527
[2021-10-12 23:59:37,899 INFO  L504         BasicCegarLoop]: Found error trace
[2021-10-12 23:59:37,900 INFO  L512         BasicCegarLoop]: trace histogram [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, 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]
[2021-10-12 23:59:37,900 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-10-12 23:59:37,901 INFO  L402      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-12 23:59:37,901 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-12 23:59:37,901 INFO  L82        PathProgramCache]: Analyzing trace with hash 156531319, now seen corresponding path program 1 times
[2021-10-12 23:59:37,902 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-12 23:59:37,904 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977918258]
[2021-10-12 23:59:37,904 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-12 23:59:37,904 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-12 23:59:38,006 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-12 23:59:38,145 INFO  L134       CoverageAnalysis]: Checked inductivity of 402 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked.
[2021-10-12 23:59:38,145 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-12 23:59:38,145 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977918258]
[2021-10-12 23:59:38,146 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977918258] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-12 23:59:38,146 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-12 23:59:38,146 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-12 23:59:38,146 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619151725]
[2021-10-12 23:59:38,147 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-12 23:59:38,147 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-12 23:59:38,149 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-12 23:59:38,149 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:38,150 INFO  L87              Difference]: Start difference. First operand 12080 states and 13126 transitions. Second operand  has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:39,493 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-12 23:59:39,493 INFO  L93              Difference]: Finished difference Result 24155 states and 26290 transitions.
[2021-10-12 23:59:39,494 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-12 23:59:39,494 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 526
[2021-10-12 23:59:39,495 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-12 23:59:39,517 INFO  L225             Difference]: With dead ends: 24155
[2021-10-12 23:59:39,517 INFO  L226             Difference]: Without dead ends: 12376
[2021-10-12 23:59:39,527 INFO  L781         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:39,537 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12376 states.
[2021-10-12 23:59:39,747 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12376 to 12076.
[2021-10-12 23:59:39,758 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12076 states, 12075 states have (on average 1.0864596273291927) internal successors, (13119), 12075 states have internal predecessors, (13119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:39,772 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12076 states to 12076 states and 13119 transitions.
[2021-10-12 23:59:39,773 INFO  L78                 Accepts]: Start accepts. Automaton has 12076 states and 13119 transitions. Word has length 526
[2021-10-12 23:59:39,774 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-12 23:59:39,774 INFO  L470      AbstractCegarLoop]: Abstraction has 12076 states and 13119 transitions.
[2021-10-12 23:59:39,774 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:39,774 INFO  L276                IsEmpty]: Start isEmpty. Operand 12076 states and 13119 transitions.
[2021-10-12 23:59:39,789 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 536
[2021-10-12 23:59:39,789 INFO  L504         BasicCegarLoop]: Found error trace
[2021-10-12 23:59:39,791 INFO  L512         BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-12 23:59:39,791 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-10-12 23:59:39,791 INFO  L402      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-12 23:59:39,792 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-12 23:59:39,792 INFO  L82        PathProgramCache]: Analyzing trace with hash 1393367976, now seen corresponding path program 1 times
[2021-10-12 23:59:39,792 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-12 23:59:39,793 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247608594]
[2021-10-12 23:59:39,793 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-12 23:59:39,793 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-12 23:59:39,873 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-12 23:59:40,004 INFO  L134       CoverageAnalysis]: Checked inductivity of 526 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked.
[2021-10-12 23:59:40,005 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-12 23:59:40,005 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247608594]
[2021-10-12 23:59:40,005 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247608594] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-12 23:59:40,005 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-12 23:59:40,006 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-12 23:59:40,006 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538775466]
[2021-10-12 23:59:40,007 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-12 23:59:40,008 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-12 23:59:40,008 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-12 23:59:40,008 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:40,009 INFO  L87              Difference]: Start difference. First operand 12076 states and 13119 transitions. Second operand  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:41,330 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-12 23:59:41,330 INFO  L93              Difference]: Finished difference Result 27138 states and 29688 transitions.
[2021-10-12 23:59:41,330 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-12 23:59:41,331 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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 535
[2021-10-12 23:59:41,332 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-12 23:59:41,355 INFO  L225             Difference]: With dead ends: 27138
[2021-10-12 23:59:41,355 INFO  L226             Difference]: Without dead ends: 14167
[2021-10-12 23:59:41,364 INFO  L781         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:41,376 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14167 states.
[2021-10-12 23:59:41,549 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14167 to 9975.
[2021-10-12 23:59:41,558 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9975 states, 9974 states have (on average 1.0796069781431723) internal successors, (10768), 9974 states have internal predecessors, (10768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:41,574 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9975 states to 9975 states and 10768 transitions.
[2021-10-12 23:59:41,574 INFO  L78                 Accepts]: Start accepts. Automaton has 9975 states and 10768 transitions. Word has length 535
[2021-10-12 23:59:41,575 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-12 23:59:41,576 INFO  L470      AbstractCegarLoop]: Abstraction has 9975 states and 10768 transitions.
[2021-10-12 23:59:41,576 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:41,576 INFO  L276                IsEmpty]: Start isEmpty. Operand 9975 states and 10768 transitions.
[2021-10-12 23:59:41,585 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 567
[2021-10-12 23:59:41,585 INFO  L504         BasicCegarLoop]: Found error trace
[2021-10-12 23:59:41,586 INFO  L512         BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2021-10-12 23:59:41,587 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-10-12 23:59:41,587 INFO  L402      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-12 23:59:41,587 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-12 23:59:41,588 INFO  L82        PathProgramCache]: Analyzing trace with hash -490078536, now seen corresponding path program 1 times
[2021-10-12 23:59:41,588 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-12 23:59:41,588 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774656556]
[2021-10-12 23:59:41,588 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-12 23:59:41,589 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-12 23:59:41,717 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-12 23:59:41,966 INFO  L134       CoverageAnalysis]: Checked inductivity of 444 backedges. 46 proven. 226 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked.
[2021-10-12 23:59:41,967 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-12 23:59:41,967 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774656556]
[2021-10-12 23:59:41,967 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774656556] provided 0 perfect and 1 imperfect interpolant sequences
[2021-10-12 23:59:41,967 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111927323]
[2021-10-12 23:59:41,968 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-12 23:59:41,968 INFO  L170          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2021-10-12 23:59:41,968 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/z3
[2021-10-12 23:59:41,974 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2021-10-12 23:59:42,004 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2021-10-12 23:59:42,185 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-12 23:59:42,188 INFO  L263         TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 2 conjunts are in the unsatisfiable core
[2021-10-12 23:59:42,206 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2021-10-12 23:59:43,454 INFO  L134       CoverageAnalysis]: Checked inductivity of 444 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked.
[2021-10-12 23:59:43,454 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111927323] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-12 23:59:43,455 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2021-10-12 23:59:43,456 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2021-10-12 23:59:43,456 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831395529]
[2021-10-12 23:59:43,457 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-12 23:59:43,457 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-12 23:59:43,458 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-12 23:59:43,458 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-12 23:59:43,458 INFO  L87              Difference]: Start difference. First operand 9975 states and 10768 transitions. Second operand  has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:44,903 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-12 23:59:44,903 INFO  L93              Difference]: Finished difference Result 11472 states and 12321 transitions.
[2021-10-12 23:59:44,905 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-12 23:59:44,905 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 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 566
[2021-10-12 23:59:44,906 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-12 23:59:44,926 INFO  L225             Difference]: With dead ends: 11472
[2021-10-12 23:59:44,927 INFO  L226             Difference]: Without dead ends: 11470
[2021-10-12 23:59:44,928 INFO  L781         BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 567 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-12 23:59:44,939 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11470 states.
[2021-10-12 23:59:45,025 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11470 to 9075.
[2021-10-12 23:59:45,033 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9075 states, 9074 states have (on average 1.0850782455366983) internal successors, (9846), 9074 states have internal predecessors, (9846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:45,045 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9075 states to 9075 states and 9846 transitions.
[2021-10-12 23:59:45,045 INFO  L78                 Accepts]: Start accepts. Automaton has 9075 states and 9846 transitions. Word has length 566
[2021-10-12 23:59:45,046 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-12 23:59:45,046 INFO  L470      AbstractCegarLoop]: Abstraction has 9075 states and 9846 transitions.
[2021-10-12 23:59:45,046 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:45,046 INFO  L276                IsEmpty]: Start isEmpty. Operand 9075 states and 9846 transitions.
[2021-10-12 23:59:45,054 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 593
[2021-10-12 23:59:45,054 INFO  L504         BasicCegarLoop]: Found error trace
[2021-10-12 23:59:45,055 INFO  L512         BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-12 23:59:45,099 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2021-10-12 23:59:45,270 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2021-10-12 23:59:45,271 INFO  L402      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-12 23:59:45,271 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-12 23:59:45,271 INFO  L82        PathProgramCache]: Analyzing trace with hash 150703321, now seen corresponding path program 1 times
[2021-10-12 23:59:45,272 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-12 23:59:45,272 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548952225]
[2021-10-12 23:59:45,272 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-12 23:59:45,272 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-12 23:59:45,392 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-12 23:59:45,555 INFO  L134       CoverageAnalysis]: Checked inductivity of 626 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked.
[2021-10-12 23:59:45,556 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-12 23:59:45,556 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548952225]
[2021-10-12 23:59:45,556 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548952225] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-12 23:59:45,556 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-12 23:59:45,556 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-12 23:59:45,557 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458355364]
[2021-10-12 23:59:45,558 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-12 23:59:45,558 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-12 23:59:45,559 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-12 23:59:45,559 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:45,559 INFO  L87              Difference]: Start difference. First operand 9075 states and 9846 transitions. Second operand  has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:46,920 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-12 23:59:46,920 INFO  L93              Difference]: Finished difference Result 22348 states and 24373 transitions.
[2021-10-12 23:59:46,921 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-12 23:59:46,921 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 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 592
[2021-10-12 23:59:46,922 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-12 23:59:46,946 INFO  L225             Difference]: With dead ends: 22348
[2021-10-12 23:59:46,946 INFO  L226             Difference]: Without dead ends: 13574
[2021-10-12 23:59:46,952 INFO  L781         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:46,963 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13574 states.
[2021-10-12 23:59:47,149 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13574 to 12965.
[2021-10-12 23:59:47,160 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12965 states, 12964 states have (on average 1.079913606911447) internal successors, (14000), 12964 states have internal predecessors, (14000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:47,177 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12965 states to 12965 states and 14000 transitions.
[2021-10-12 23:59:47,177 INFO  L78                 Accepts]: Start accepts. Automaton has 12965 states and 14000 transitions. Word has length 592
[2021-10-12 23:59:47,178 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-12 23:59:47,178 INFO  L470      AbstractCegarLoop]: Abstraction has 12965 states and 14000 transitions.
[2021-10-12 23:59:47,179 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:47,179 INFO  L276                IsEmpty]: Start isEmpty. Operand 12965 states and 14000 transitions.
[2021-10-12 23:59:47,188 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 598
[2021-10-12 23:59:47,188 INFO  L504         BasicCegarLoop]: Found error trace
[2021-10-12 23:59:47,189 INFO  L512         BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-12 23:59:47,189 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2021-10-12 23:59:47,190 INFO  L402      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-12 23:59:47,190 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-12 23:59:47,190 INFO  L82        PathProgramCache]: Analyzing trace with hash -80103056, now seen corresponding path program 1 times
[2021-10-12 23:59:47,190 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-12 23:59:47,191 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404130447]
[2021-10-12 23:59:47,191 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-12 23:59:47,191 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-12 23:59:47,274 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-12 23:59:47,516 INFO  L134       CoverageAnalysis]: Checked inductivity of 665 backedges. 69 proven. 310 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked.
[2021-10-12 23:59:47,516 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-12 23:59:47,517 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404130447]
[2021-10-12 23:59:47,517 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404130447] provided 0 perfect and 1 imperfect interpolant sequences
[2021-10-12 23:59:47,517 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871934719]
[2021-10-12 23:59:47,517 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-12 23:59:47,517 INFO  L170          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2021-10-12 23:59:47,518 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/z3
[2021-10-12 23:59:47,526 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2021-10-12 23:59:47,546 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2021-10-12 23:59:47,864 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-12 23:59:47,866 INFO  L263         TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 2 conjunts are in the unsatisfiable core
[2021-10-12 23:59:47,874 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2021-10-12 23:59:49,230 INFO  L134       CoverageAnalysis]: Checked inductivity of 665 backedges. 367 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked.
[2021-10-12 23:59:49,231 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871934719] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-12 23:59:49,231 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2021-10-12 23:59:49,231 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2021-10-12 23:59:49,234 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819753978]
[2021-10-12 23:59:49,235 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-12 23:59:49,236 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-12 23:59:49,236 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-12 23:59:49,237 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2021-10-12 23:59:49,237 INFO  L87              Difference]: Start difference. First operand 12965 states and 14000 transitions. Second operand  has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:50,545 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-12 23:59:50,546 INFO  L93              Difference]: Finished difference Result 28319 states and 30815 transitions.
[2021-10-12 23:59:50,546 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-12 23:59:50,546 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 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 597
[2021-10-12 23:59:50,547 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-12 23:59:50,567 INFO  L225             Difference]: With dead ends: 28319
[2021-10-12 23:59:50,567 INFO  L226             Difference]: Without dead ends: 15655
[2021-10-12 23:59:50,574 INFO  L781         BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 598 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.4ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2021-10-12 23:59:50,587 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15655 states.
[2021-10-12 23:59:50,724 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15655 to 15356.
[2021-10-12 23:59:50,737 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15356 states, 15355 states have (on average 1.0844024747639205) internal successors, (16651), 15355 states have internal predecessors, (16651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:50,756 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15356 states to 15356 states and 16651 transitions.
[2021-10-12 23:59:50,757 INFO  L78                 Accepts]: Start accepts. Automaton has 15356 states and 16651 transitions. Word has length 597
[2021-10-12 23:59:50,757 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-12 23:59:50,758 INFO  L470      AbstractCegarLoop]: Abstraction has 15356 states and 16651 transitions.
[2021-10-12 23:59:50,758 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:50,758 INFO  L276                IsEmpty]: Start isEmpty. Operand 15356 states and 16651 transitions.
[2021-10-12 23:59:50,768 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 623
[2021-10-12 23:59:50,769 INFO  L504         BasicCegarLoop]: Found error trace
[2021-10-12 23:59:50,769 INFO  L512         BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2021-10-12 23:59:50,806 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2021-10-12 23:59:50,982 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2021-10-12 23:59:50,983 INFO  L402      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-12 23:59:50,983 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-12 23:59:50,983 INFO  L82        PathProgramCache]: Analyzing trace with hash -1528762542, now seen corresponding path program 1 times
[2021-10-12 23:59:50,983 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-12 23:59:50,983 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809317655]
[2021-10-12 23:59:50,983 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-12 23:59:50,984 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-12 23:59:51,080 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-12 23:59:51,241 INFO  L134       CoverageAnalysis]: Checked inductivity of 500 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked.
[2021-10-12 23:59:51,241 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-12 23:59:51,241 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809317655]
[2021-10-12 23:59:51,241 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809317655] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-12 23:59:51,242 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-12 23:59:51,242 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-12 23:59:51,242 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004862420]
[2021-10-12 23:59:51,243 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-12 23:59:51,243 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-12 23:59:51,244 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-12 23:59:51,244 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:51,244 INFO  L87              Difference]: Start difference. First operand 15356 states and 16651 transitions. Second operand  has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:52,973 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-12 23:59:52,973 INFO  L93              Difference]: Finished difference Result 35226 states and 38397 transitions.
[2021-10-12 23:59:52,974 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-12 23:59:52,974 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 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 622
[2021-10-12 23:59:52,975 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-12 23:59:53,000 INFO  L225             Difference]: With dead ends: 35226
[2021-10-12 23:59:53,000 INFO  L226             Difference]: Without dead ends: 20171
[2021-10-12 23:59:53,014 INFO  L781         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:53,032 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20171 states.
[2021-10-12 23:59:53,206 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20171 to 15964.
[2021-10-12 23:59:53,218 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15964 states, 15963 states have (on average 1.089582158742091) internal successors, (17393), 15963 states have internal predecessors, (17393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:53,242 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15964 states to 15964 states and 17393 transitions.
[2021-10-12 23:59:53,242 INFO  L78                 Accepts]: Start accepts. Automaton has 15964 states and 17393 transitions. Word has length 622
[2021-10-12 23:59:53,243 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-12 23:59:53,243 INFO  L470      AbstractCegarLoop]: Abstraction has 15964 states and 17393 transitions.
[2021-10-12 23:59:53,244 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:53,244 INFO  L276                IsEmpty]: Start isEmpty. Operand 15964 states and 17393 transitions.
[2021-10-12 23:59:53,255 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 634
[2021-10-12 23:59:53,256 INFO  L504         BasicCegarLoop]: Found error trace
[2021-10-12 23:59:53,256 INFO  L512         BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2021-10-12 23:59:53,256 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2021-10-12 23:59:53,257 INFO  L402      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-12 23:59:53,257 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-12 23:59:53,257 INFO  L82        PathProgramCache]: Analyzing trace with hash 891537974, now seen corresponding path program 1 times
[2021-10-12 23:59:53,258 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-12 23:59:53,258 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453390713]
[2021-10-12 23:59:53,258 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-12 23:59:53,258 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-12 23:59:53,364 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-12 23:59:53,536 INFO  L134       CoverageAnalysis]: Checked inductivity of 511 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked.
[2021-10-12 23:59:53,536 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-12 23:59:53,536 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453390713]
[2021-10-12 23:59:53,537 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453390713] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-12 23:59:53,537 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-12 23:59:53,537 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-12 23:59:53,537 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784181794]
[2021-10-12 23:59:53,539 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-12 23:59:53,539 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-12 23:59:53,539 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-12 23:59:53,540 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:53,540 INFO  L87              Difference]: Start difference. First operand 15964 states and 17393 transitions. Second operand  has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:54,937 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-12 23:59:54,937 INFO  L93              Difference]: Finished difference Result 37917 states and 41208 transitions.
[2021-10-12 23:59:54,937 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-12 23:59:54,937 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 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 633
[2021-10-12 23:59:54,938 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-12 23:59:54,950 INFO  L225             Difference]: With dead ends: 37917
[2021-10-12 23:59:54,950 INFO  L226             Difference]: Without dead ends: 19563
[2021-10-12 23:59:54,957 INFO  L781         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-12 23:59:54,971 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19563 states.
[2021-10-12 23:59:55,130 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19563 to 15964.
[2021-10-12 23:59:55,141 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15964 states, 15963 states have (on average 1.0835056067155298) internal successors, (17296), 15963 states have internal predecessors, (17296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:55,161 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15964 states to 15964 states and 17296 transitions.
[2021-10-12 23:59:55,162 INFO  L78                 Accepts]: Start accepts. Automaton has 15964 states and 17296 transitions. Word has length 633
[2021-10-12 23:59:55,162 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-12 23:59:55,162 INFO  L470      AbstractCegarLoop]: Abstraction has 15964 states and 17296 transitions.
[2021-10-12 23:59:55,163 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:55,163 INFO  L276                IsEmpty]: Start isEmpty. Operand 15964 states and 17296 transitions.
[2021-10-12 23:59:55,173 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 635
[2021-10-12 23:59:55,173 INFO  L504         BasicCegarLoop]: Found error trace
[2021-10-12 23:59:55,175 INFO  L512         BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2021-10-12 23:59:55,175 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2021-10-12 23:59:55,175 INFO  L402      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-12 23:59:55,176 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-12 23:59:55,176 INFO  L82        PathProgramCache]: Analyzing trace with hash 957382380, now seen corresponding path program 1 times
[2021-10-12 23:59:55,176 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-12 23:59:55,177 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329761320]
[2021-10-12 23:59:55,177 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-12 23:59:55,177 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-12 23:59:55,283 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-12 23:59:55,526 INFO  L134       CoverageAnalysis]: Checked inductivity of 651 backedges. 343 proven. 188 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked.
[2021-10-12 23:59:55,527 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-12 23:59:55,527 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329761320]
[2021-10-12 23:59:55,527 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329761320] provided 0 perfect and 1 imperfect interpolant sequences
[2021-10-12 23:59:55,527 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661368609]
[2021-10-12 23:59:55,527 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-12 23:59:55,528 INFO  L170          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2021-10-12 23:59:55,528 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/z3
[2021-10-12 23:59:55,531 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2021-10-12 23:59:55,553 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2021-10-12 23:59:56,121 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-12 23:59:56,124 INFO  L263         TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 3 conjunts are in the unsatisfiable core
[2021-10-12 23:59:56,133 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2021-10-12 23:59:57,931 INFO  L134       CoverageAnalysis]: Checked inductivity of 651 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked.
[2021-10-12 23:59:57,932 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661368609] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-12 23:59:57,932 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2021-10-12 23:59:57,932 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2021-10-12 23:59:57,932 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425918897]
[2021-10-12 23:59:57,933 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-12 23:59:57,933 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-12 23:59:57,934 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-12 23:59:57,934 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2021-10-12 23:59:57,934 INFO  L87              Difference]: Start difference. First operand 15964 states and 17296 transitions. Second operand  has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:59,312 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-12 23:59:59,312 INFO  L93              Difference]: Finished difference Result 36435 states and 39387 transitions.
[2021-10-12 23:59:59,312 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-12 23:59:59,313 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 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 634
[2021-10-12 23:59:59,313 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-12 23:59:59,332 INFO  L225             Difference]: With dead ends: 36435
[2021-10-12 23:59:59,332 INFO  L226             Difference]: Without dead ends: 20772
[2021-10-12 23:59:59,341 INFO  L781         BasicCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 633 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.1ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2021-10-12 23:59:59,361 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20772 states.
[2021-10-12 23:59:59,516 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20772 to 17461.
[2021-10-12 23:59:59,525 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17461 states, 17460 states have (on average 1.0823596792668957) internal successors, (18898), 17460 states have internal predecessors, (18898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:59,540 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17461 states to 17461 states and 18898 transitions.
[2021-10-12 23:59:59,541 INFO  L78                 Accepts]: Start accepts. Automaton has 17461 states and 18898 transitions. Word has length 634
[2021-10-12 23:59:59,541 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-12 23:59:59,541 INFO  L470      AbstractCegarLoop]: Abstraction has 17461 states and 18898 transitions.
[2021-10-12 23:59:59,541 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-12 23:59:59,542 INFO  L276                IsEmpty]: Start isEmpty. Operand 17461 states and 18898 transitions.
[2021-10-12 23:59:59,552 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 647
[2021-10-12 23:59:59,552 INFO  L504         BasicCegarLoop]: Found error trace
[2021-10-12 23:59:59,553 INFO  L512         BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-12 23:59:59,592 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2021-10-12 23:59:59,766 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2021-10-12 23:59:59,767 INFO  L402      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-12 23:59:59,767 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-12 23:59:59,767 INFO  L82        PathProgramCache]: Analyzing trace with hash -394913658, now seen corresponding path program 1 times
[2021-10-12 23:59:59,768 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-12 23:59:59,768 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143229983]
[2021-10-12 23:59:59,768 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-12 23:59:59,768 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-12 23:59:59,899 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-13 00:00:00,078 INFO  L134       CoverageAnalysis]: Checked inductivity of 694 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked.
[2021-10-13 00:00:00,078 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-13 00:00:00,079 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143229983]
[2021-10-13 00:00:00,079 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143229983] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-13 00:00:00,079 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-13 00:00:00,079 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-13 00:00:00,079 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476189773]
[2021-10-13 00:00:00,081 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-10-13 00:00:00,082 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-13 00:00:00,083 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-13 00:00:00,083 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-13 00:00:00,083 INFO  L87              Difference]: Start difference. First operand 17461 states and 18898 transitions. Second operand  has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-13 00:00:01,469 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-13 00:00:01,469 INFO  L93              Difference]: Finished difference Result 39733 states and 43080 transitions.
[2021-10-13 00:00:01,469 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-10-13 00:00:01,469 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 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 646
[2021-10-13 00:00:01,470 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-13 00:00:01,485 INFO  L225             Difference]: With dead ends: 39733
[2021-10-13 00:00:01,485 INFO  L226             Difference]: Without dead ends: 22573
[2021-10-13 00:00:01,492 INFO  L781         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-13 00:00:01,507 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22573 states.
[2021-10-13 00:00:01,660 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22573 to 17455.
[2021-10-13 00:00:01,669 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17455 states, 17454 states have (on average 1.0817577632634354) internal successors, (18881), 17454 states have internal predecessors, (18881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-13 00:00:01,685 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17455 states to 17455 states and 18881 transitions.
[2021-10-13 00:00:01,686 INFO  L78                 Accepts]: Start accepts. Automaton has 17455 states and 18881 transitions. Word has length 646
[2021-10-13 00:00:01,686 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-13 00:00:01,686 INFO  L470      AbstractCegarLoop]: Abstraction has 17455 states and 18881 transitions.
[2021-10-13 00:00:01,686 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-13 00:00:01,687 INFO  L276                IsEmpty]: Start isEmpty. Operand 17455 states and 18881 transitions.
[2021-10-13 00:00:01,694 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 683
[2021-10-13 00:00:01,694 INFO  L504         BasicCegarLoop]: Found error trace
[2021-10-13 00:00:01,695 INFO  L512         BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-13 00:00:01,695 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2021-10-13 00:00:01,695 INFO  L402      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-13 00:00:01,695 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-13 00:00:01,696 INFO  L82        PathProgramCache]: Analyzing trace with hash -1592839484, now seen corresponding path program 1 times
[2021-10-13 00:00:01,696 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-13 00:00:01,696 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002355680]
[2021-10-13 00:00:01,696 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-13 00:00:01,697 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-13 00:00:01,796 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-13 00:00:02,116 INFO  L134       CoverageAnalysis]: Checked inductivity of 728 backedges. 289 proven. 416 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked.
[2021-10-13 00:00:02,117 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-13 00:00:02,117 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002355680]
[2021-10-13 00:00:02,117 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002355680] provided 0 perfect and 1 imperfect interpolant sequences
[2021-10-13 00:00:02,117 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047397172]
[2021-10-13 00:00:02,118 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-13 00:00:02,118 INFO  L170          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2021-10-13 00:00:02,118 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/z3
[2021-10-13 00:00:02,119 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2021-10-13 00:00:02,144 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2021-10-13 00:00:02,974 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-13 00:00:02,977 INFO  L263         TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 4 conjunts are in the unsatisfiable core
[2021-10-13 00:00:02,992 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2021-10-13 00:00:05,230 INFO  L134       CoverageAnalysis]: Checked inductivity of 728 backedges. 502 proven. 106 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked.
[2021-10-13 00:00:05,230 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047397172] provided 0 perfect and 1 imperfect interpolant sequences
[2021-10-13 00:00:05,230 INFO  L186   FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2021-10-13 00:00:05,231 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 7
[2021-10-13 00:00:05,231 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737018234]
[2021-10-13 00:00:05,233 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2021-10-13 00:00:05,233 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-13 00:00:05,234 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-10-13 00:00:05,234 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2021-10-13 00:00:05,234 INFO  L87              Difference]: Start difference. First operand 17455 states and 18881 transitions. Second operand  has 8 states, 8 states have (on average 146.125) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-13 00:00:11,461 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-13 00:00:11,461 INFO  L93              Difference]: Finished difference Result 43523 states and 46922 transitions.
[2021-10-13 00:00:11,464 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2021-10-13 00:00:11,464 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 146.125) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 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 682
[2021-10-13 00:00:11,464 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-13 00:00:11,482 INFO  L225             Difference]: With dead ends: 43523
[2021-10-13 00:00:11,482 INFO  L226             Difference]: Without dead ends: 26369
[2021-10-13 00:00:11,489 INFO  L781         BasicCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 680 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 158.5ms TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210
[2021-10-13 00:00:11,506 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26369 states.
[2021-10-13 00:00:11,697 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26369 to 24947.
[2021-10-13 00:00:11,712 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 24947 states, 24946 states have (on average 1.073799406718512) internal successors, (26787), 24946 states have internal predecessors, (26787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-13 00:00:11,738 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24947 states to 24947 states and 26787 transitions.
[2021-10-13 00:00:11,738 INFO  L78                 Accepts]: Start accepts. Automaton has 24947 states and 26787 transitions. Word has length 682
[2021-10-13 00:00:11,738 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-10-13 00:00:11,738 INFO  L470      AbstractCegarLoop]: Abstraction has 24947 states and 26787 transitions.
[2021-10-13 00:00:11,739 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 146.125) internal successors, (1169), 7 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-13 00:00:11,739 INFO  L276                IsEmpty]: Start isEmpty. Operand 24947 states and 26787 transitions.
[2021-10-13 00:00:11,748 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 695
[2021-10-13 00:00:11,748 INFO  L504         BasicCegarLoop]: Found error trace
[2021-10-13 00:00:11,749 INFO  L512         BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-13 00:00:11,783 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2021-10-13 00:00:11,974 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2021-10-13 00:00:11,975 INFO  L402      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2021-10-13 00:00:11,975 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-13 00:00:11,975 INFO  L82        PathProgramCache]: Analyzing trace with hash -848585594, now seen corresponding path program 1 times
[2021-10-13 00:00:11,976 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-13 00:00:11,976 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342781862]
[2021-10-13 00:00:11,976 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-13 00:00:11,976 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-13 00:00:12,313 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-13 00:00:12,313 INFO  L354             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-13 00:00:12,465 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-13 00:00:12,843 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-13 00:00:12,843 INFO  L626         BasicCegarLoop]: Counterexample is feasible
[2021-10-13 00:00:12,844 INFO  L764   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION
[2021-10-13 00:00:12,846 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2021-10-13 00:00:12,853 INFO  L179   ceAbstractionStarter]: Computing trace abstraction results
[2021-10-13 00:00:13,127 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:00:13 BoogieIcfgContainer
[2021-10-13 00:00:13,127 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-10-13 00:00:13,128 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2021-10-13 00:00:13,128 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2021-10-13 00:00:13,128 INFO  L275        PluginConnector]: Witness Printer initialized
[2021-10-13 00:00:13,129 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:59:12" (3/4) ...
[2021-10-13 00:00:13,131 INFO  L131         WitnessPrinter]: Generating witness for reachability counterexample
[2021-10-13 00:00:13,465 INFO  L141         WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/witness.graphml
[2021-10-13 00:00:13,465 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2021-10-13 00:00:13,467 INFO  L168              Benchmark]: Toolchain (without parser) took 66150.26 ms. Allocated memory was 83.9 MB in the beginning and 876.6 MB in the end (delta: 792.7 MB). Free memory was 54.8 MB in the beginning and 474.9 MB in the end (delta: -420.1 MB). Peak memory consumption was 371.6 MB. Max. memory is 16.1 GB.
[2021-10-13 00:00:13,467 INFO  L168              Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 83.9 MB. Free memory was 57.9 MB in the beginning and 57.9 MB in the end (delta: 38.0 kB). There was no memory consumed. Max. memory is 16.1 GB.
[2021-10-13 00:00:13,468 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 1427.07 ms. Allocated memory was 83.9 MB in the beginning and 102.8 MB in the end (delta: 18.9 MB). Free memory was 54.6 MB in the beginning and 60.1 MB in the end (delta: -5.5 MB). Peak memory consumption was 34.9 MB. Max. memory is 16.1 GB.
[2021-10-13 00:00:13,468 INFO  L168              Benchmark]: Boogie Procedure Inliner took 243.22 ms. Allocated memory is still 102.8 MB. Free memory was 60.1 MB in the beginning and 41.4 MB in the end (delta: 18.8 MB). Peak memory consumption was 35.6 MB. Max. memory is 16.1 GB.
[2021-10-13 00:00:13,468 INFO  L168              Benchmark]: Boogie Preprocessor took 234.50 ms. Allocated memory was 102.8 MB in the beginning and 167.8 MB in the end (delta: 65.0 MB). Free memory was 41.4 MB in the beginning and 99.1 MB in the end (delta: -57.8 MB). Peak memory consumption was 21.9 MB. Max. memory is 16.1 GB.
[2021-10-13 00:00:13,469 INFO  L168              Benchmark]: RCFGBuilder took 3229.09 ms. Allocated memory was 167.8 MB in the beginning and 306.2 MB in the end (delta: 138.4 MB). Free memory was 99.1 MB in the beginning and 230.3 MB in the end (delta: -131.2 MB). Peak memory consumption was 91.1 MB. Max. memory is 16.1 GB.
[2021-10-13 00:00:13,469 INFO  L168              Benchmark]: TraceAbstraction took 60669.76 ms. Allocated memory was 306.2 MB in the beginning and 876.6 MB in the end (delta: 570.4 MB). Free memory was 230.3 MB in the beginning and 564.5 MB in the end (delta: -334.2 MB). Peak memory consumption was 612.7 MB. Max. memory is 16.1 GB.
[2021-10-13 00:00:13,470 INFO  L168              Benchmark]: Witness Printer took 337.55 ms. Allocated memory is still 876.6 MB. Free memory was 564.5 MB in the beginning and 474.9 MB in the end (delta: 89.6 MB). Peak memory consumption was 90.2 MB. Max. memory is 16.1 GB.
[2021-10-13 00:00:13,472 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.18 ms. Allocated memory is still 83.9 MB. Free memory was 57.9 MB in the beginning and 57.9 MB in the end (delta: 38.0 kB). There was no memory consumed. Max. memory is 16.1 GB.
 * CACSL2BoogieTranslator took 1427.07 ms. Allocated memory was 83.9 MB in the beginning and 102.8 MB in the end (delta: 18.9 MB). Free memory was 54.6 MB in the beginning and 60.1 MB in the end (delta: -5.5 MB). Peak memory consumption was 34.9 MB. Max. memory is 16.1 GB.
 * Boogie Procedure Inliner took 243.22 ms. Allocated memory is still 102.8 MB. Free memory was 60.1 MB in the beginning and 41.4 MB in the end (delta: 18.8 MB). Peak memory consumption was 35.6 MB. Max. memory is 16.1 GB.
 * Boogie Preprocessor took 234.50 ms. Allocated memory was 102.8 MB in the beginning and 167.8 MB in the end (delta: 65.0 MB). Free memory was 41.4 MB in the beginning and 99.1 MB in the end (delta: -57.8 MB). Peak memory consumption was 21.9 MB. Max. memory is 16.1 GB.
 * RCFGBuilder took 3229.09 ms. Allocated memory was 167.8 MB in the beginning and 306.2 MB in the end (delta: 138.4 MB). Free memory was 99.1 MB in the beginning and 230.3 MB in the end (delta: -131.2 MB). Peak memory consumption was 91.1 MB. Max. memory is 16.1 GB.
 * TraceAbstraction took 60669.76 ms. Allocated memory was 306.2 MB in the beginning and 876.6 MB in the end (delta: 570.4 MB). Free memory was 230.3 MB in the beginning and 564.5 MB in the end (delta: -334.2 MB). Peak memory consumption was 612.7 MB. Max. memory is 16.1 GB.
 * Witness Printer took 337.55 ms. Allocated memory is still 876.6 MB. Free memory was 564.5 MB in the beginning and 474.9 MB in the end (delta: 89.6 MB). Peak memory consumption was 90.2 MB. Max. memory is 16.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - CounterExampleResult [Line: 92]: 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, a2=1, a29=-127, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1773]              int output = -1;
         VAL         [a0=-44, a2=1, a29=-127, 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))
[L34]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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, a2=1, a29=-127, a4=-89, 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         [a0=-44, a2=2, a29=4454, a4=-89, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[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))
[L34]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-44, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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, a2=2, a29=4454, a4=-89, 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         [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[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))
[L34]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-123, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, 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=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1144]  COND TRUE   (((((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 )) &&   ((-86 < a4) && (-42 >= a4)) ) &&   ((-147 < a0) && (-98 >= a0)) ) && (a2==3))
         VAL         [a0=-123, a2=3, a29=135549, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1145]  COND FALSE  !(((-98 < a0) && (-61 >= a0)))
[L1150]              a0 = (((a0 - 401265) / 5) + -135803)
[L1151]              a29 = ((((a29 % 299978)+ 300021) - 0) * 1)
[L1152]              a2 = 4
         VAL         [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L1154]              return 22;
         VAL         [a0=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[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))
[L34]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, 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=-216080, a2=4, a29=435570, a4=-58, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L276]   COND TRUE   ((((a2==4) && ((input == 1) && (  ((-16 < a29) && (43 >= a29))  ||  43 < a29 ))) &&   ((-86 < a4) && (-42 >= a4)) ) &&  a0 <=  -147 )
[L277]               a4 = (((a4 * 5) + -228988) / 5)
[L278]               a0 = ((((((a0 % 18)+ -78) * 9)/ 10) * 9)/ 10)
[L279]               a29 = ((((((a29 * 9)/ 10) / 5) + 262161) % 29)- -15)
[L280]               a2 = 1
[L282]               return -1;
         VAL         [a0=-69, a2=1, a29=31, a4=-45855, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[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))
[L34]    COND FALSE  !(((((a2==1) &&  a4 <=  -86 ) &&  a0 <=  -147 ) &&   ((-144 < a29) && (-16 >= a29)) ))
         VAL         [a0=-69, a2=1, a29=31, a4=-45855, 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=-69, a2=1, a29=31, a4=-45855, 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=-69, a2=1, a29=31, a4=-45855, 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=-69, a2=1, a29=31, a4=-45855, 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=-69, a2=1, a29=31, a4=-45855, 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=-69, a2=1, a29=31, a4=-45855, 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=-69, a2=1, a29=31, a4=-45855, 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=-69, a2=1, a29=31, a4=-45855, 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=-69, a2=1, a29=31, a4=-45855, 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=-69, a2=1, a29=31, a4=-45855, 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=-69, a2=1, a29=31, a4=-45855, 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=-69, a2=1, a29=31, a4=-45855, 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=-69, a2=1, a29=31, a4=-45855, 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=-69, a2=1, a29=31, a4=-45855, 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=-69, a2=1, a29=31, a4=-45855, 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=-69, a2=1, a29=31, a4=-45855, 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=-69, a2=1, a29=31, a4=-45855, 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=-69, a2=1, a29=31, a4=-45855, 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=-69, a2=1, a29=31, a4=-45855, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L91]    COND TRUE   ((((a2==1) &&  a4 <=  -86 ) &&   ((-98 < a0) && (-61 >= a0)) ) &&   ((-16 < a29) && (43 >= a29)) )
         VAL         [a0=-69, a2=1, a29=31, a4=-45855, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6]
[L92]                reach_error()
         VAL         [a0=-69, a2=1, a29=31, a4=-45855, 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: 60312.8ms, OverallIterations: 21, TraceHistogramMax: 5, EmptinessCheckTime: 182.0ms, AutomataDifference: 41079.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 25.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 6688 SDtfs, 6696 SDslu, 1059 SDs, 0 SdLazy, 24755 SolverSat, 3731 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32478.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2544 GetRequests, 2504 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 252.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=24947occurred in iteration=20, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 3363.5ms AutomataMinimizationTime, 20 MinimizatonAttempts, 27588 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 596.7ms SsaConstructionTime, 2001.3ms SatisfiabilityAnalysisTime, 9886.6ms InterpolantComputationTime, 11445 NumberOfCodeBlocks, 11445 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 10727 ConstructedInterpolants, 0 QuantifiedInterpolants, 38933 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3089 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 24 InterpolantComputations, 19 PerfectInterpolantSequences, 7765/9011 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!
[2021-10-13 00:00:13,534 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5aff35c-1aed-4b5e-8bcc-29ed0abba9b0/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...