./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_label31.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label31.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash abd3e009209f6e7296872cfad9ad7f60b855cd93 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label31.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash abd3e009209f6e7296872cfad9ad7f60b855cd93 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.0-7b2dab5 [2020-12-09 16:56:31,055 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 16:56:31,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 16:56:31,093 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 16:56:31,094 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 16:56:31,094 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 16:56:31,096 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 16:56:31,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 16:56:31,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 16:56:31,099 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 16:56:31,100 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 16:56:31,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 16:56:31,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 16:56:31,102 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 16:56:31,103 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 16:56:31,104 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 16:56:31,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 16:56:31,105 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 16:56:31,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 16:56:31,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 16:56:31,110 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 16:56:31,111 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 16:56:31,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 16:56:31,113 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 16:56:31,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 16:56:31,116 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 16:56:31,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 16:56:31,118 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 16:56:31,118 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 16:56:31,119 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 16:56:31,120 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 16:56:31,120 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 16:56:31,121 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 16:56:31,122 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 16:56:31,123 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 16:56:31,123 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 16:56:31,124 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 16:56:31,125 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 16:56:31,125 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 16:56:31,126 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 16:56:31,126 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 16:56:31,127 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 16:56:31,148 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 16:56:31,149 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 16:56:31,149 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 16:56:31,150 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 16:56:31,150 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 16:56:31,150 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 16:56:31,150 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 16:56:31,150 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 16:56:31,150 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 16:56:31,150 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 16:56:31,150 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 16:56:31,150 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 16:56:31,151 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 16:56:31,151 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 16:56:31,151 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 16:56:31,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 16:56:31,152 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 16:56:31,152 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 16:56:31,152 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 16:56:31,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 16:56:31,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 16:56:31,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 16:56:31,152 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 16:56:31,152 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 16:56:31,153 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 16:56:31,153 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 16:56:31,153 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 16:56:31,153 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 16:56:31,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 16:56:31,153 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 16:56:31,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 16:56:31,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 16:56:31,153 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 16:56:31,154 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 16:56:31,154 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 16:56:31,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 16:56:31,154 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 16:56:31,154 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 16:56:31,154 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 16:56:31,154 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/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-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan 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 -> Taipan 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 -> abd3e009209f6e7296872cfad9ad7f60b855cd93 [2020-12-09 16:56:31,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 16:56:31,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 16:56:31,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 16:56:31,361 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 16:56:31,361 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 16:56:31,362 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem14_label31.c [2020-12-09 16:56:31,403 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/data/43311d512/fed05db40caf4d40b5e1c9e4e6c83020/FLAGb8f064ce4 [2020-12-09 16:56:31,822 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 16:56:31,822 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/sv-benchmarks/c/eca-rers2012/Problem14_label31.c [2020-12-09 16:56:31,832 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/data/43311d512/fed05db40caf4d40b5e1c9e4e6c83020/FLAGb8f064ce4 [2020-12-09 16:56:31,842 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/data/43311d512/fed05db40caf4d40b5e1c9e4e6c83020 [2020-12-09 16:56:31,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 16:56:31,844 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 16:56:31,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 16:56:31,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 16:56:31,848 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 16:56:31,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:56:31" (1/1) ... [2020-12-09 16:56:31,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47e8b00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:31, skipping insertion in model container [2020-12-09 16:56:31,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:56:31" (1/1) ... [2020-12-09 16:56:31,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 16:56:31,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 16:56:32,016 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/sv-benchmarks/c/eca-rers2012/Problem14_label31.c[2583,2596] [2020-12-09 16:56:32,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 16:56:32,144 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 16:56:32,155 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/sv-benchmarks/c/eca-rers2012/Problem14_label31.c[2583,2596] [2020-12-09 16:56:32,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 16:56:32,229 INFO L208 MainTranslator]: Completed translation [2020-12-09 16:56:32,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:32 WrapperNode [2020-12-09 16:56:32,229 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 16:56:32,230 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 16:56:32,230 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 16:56:32,230 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 16:56:32,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:32" (1/1) ... [2020-12-09 16:56:32,252 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:32" (1/1) ... [2020-12-09 16:56:32,294 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 16:56:32,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 16:56:32,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 16:56:32,295 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 16:56:32,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:32" (1/1) ... [2020-12-09 16:56:32,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:32" (1/1) ... [2020-12-09 16:56:32,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:32" (1/1) ... [2020-12-09 16:56:32,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:32" (1/1) ... [2020-12-09 16:56:32,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:32" (1/1) ... [2020-12-09 16:56:32,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:32" (1/1) ... [2020-12-09 16:56:32,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:32" (1/1) ... [2020-12-09 16:56:32,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 16:56:32,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 16:56:32,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 16:56:32,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 16:56:32,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 16:56:32,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 16:56:32,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 16:56:32,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 16:56:32,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 16:56:42,978 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 16:56:42,979 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-09 16:56:42,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:56:42 BoogieIcfgContainer [2020-12-09 16:56:42,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 16:56:42,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 16:56:42,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 16:56:42,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 16:56:42,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:56:31" (1/3) ... [2020-12-09 16:56:42,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101a2681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:56:42, skipping insertion in model container [2020-12-09 16:56:42,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:56:32" (2/3) ... [2020-12-09 16:56:42,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@101a2681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:56:42, skipping insertion in model container [2020-12-09 16:56:42,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:56:42" (3/3) ... [2020-12-09 16:56:42,986 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem14_label31.c [2020-12-09 16:56:42,996 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 16:56:42,998 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 16:56:43,026 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 16:56:43,042 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 16:56:43,042 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 16:56:43,042 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 16:56:43,042 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 16:56:43,042 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 16:56:43,042 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 16:56:43,043 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 16:56:43,043 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 16:56:43,054 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-12-09 16:56:43,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 16:56:43,057 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:56:43,058 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 16:56:43,058 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:56:43,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:56:43,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1037736968, now seen corresponding path program 1 times [2020-12-09 16:56:43,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:56:43,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276818443] [2020-12-09 16:56:43,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:56:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:56:43,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:56:43,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276818443] [2020-12-09 16:56:43,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:56:43,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 16:56:43,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632398945] [2020-12-09 16:56:43,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:56:43,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 16:56:43,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:56:43,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:56:43,210 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-12-09 16:56:43,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:56:43,270 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-12-09 16:56:43,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:56:43,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-09 16:56:43,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:56:43,278 INFO L225 Difference]: With dead ends: 23 [2020-12-09 16:56:43,278 INFO L226 Difference]: Without dead ends: 11 [2020-12-09 16:56:43,280 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:56:43,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-12-09 16:56:43,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-12-09 16:56:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-12-09 16:56:43,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2020-12-09 16:56:43,303 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 5 [2020-12-09 16:56:43,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:56:43,304 INFO L481 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2020-12-09 16:56:43,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:56:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-12-09 16:56:43,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 16:56:43,304 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:56:43,304 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2020-12-09 16:56:43,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 16:56:43,305 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:56:43,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:56:43,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1446521599, now seen corresponding path program 1 times [2020-12-09 16:56:43,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 16:56:43,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483255131] [2020-12-09 16:56:43,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 16:56:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:56:43,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:56:43,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483255131] [2020-12-09 16:56:43,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864725215] [2020-12-09 16:56:43,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:56:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:56:43,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 16:56:43,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:56:43,942 WARN L197 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 1339 DAG size of output: 83 [2020-12-09 16:56:43,989 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 16:56:43,991 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 16:56:43,993 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:43,994 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:43,995 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 16:56:43,996 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 16:56:43,998 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,000 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 16:56:44,008 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,009 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:44,011 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,013 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:44,017 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,018 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 16:56:44,025 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:44,026 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,028 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:44,029 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,031 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 16:56:44,036 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,037 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:44,042 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,044 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 16:56:44,045 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:56:44,047 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 16:56:44,050 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,052 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:44,058 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,060 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,061 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 16:56:44,062 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 16:56:44,063 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:56:44,064 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 16:56:44,066 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 16:56:44,067 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 16:56:44,072 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:56:44,073 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 16:56:44,077 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,079 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 16:56:44,079 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,080 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:44,084 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:56:44,085 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 16:56:44,088 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:44,089 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,090 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 16:56:44,091 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:56:44,092 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 16:56:44,095 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,096 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:44,099 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,101 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:44,101 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,103 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 16:56:44,105 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,106 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:44,113 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,114 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:44,115 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,117 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,118 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 16:56:44,119 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 16:56:44,120 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,121 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 16:56:44,122 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:56:44,123 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 16:56:44,127 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,128 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:44,133 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:56:44,134 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 16:56:44,135 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 16:56:44,137 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 16:56:44,140 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:56:44,142 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 16:56:44,146 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:44,147 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,148 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:44,148 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,149 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 16:56:44,153 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,154 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:44,157 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,157 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 16:56:44,158 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,159 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:44,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:56:44,163 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 16:56:44,167 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,168 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:56:44,170 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 16:56:44,171 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 16:56:44,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:56:44,173 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 16:56:44,174 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:56:44,175 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 16:56:44,178 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 16:56:44,180 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 16:56:44,184 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 16:56:44,185 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 6 disjuncts [2020-12-09 16:56:44,186 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 16:56:44,188 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 16:56:44,191 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 16:56:44,192 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 6 disjuncts [2020-12-09 16:56:44,197 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 16:56:44,198 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,198 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 16:56:44,199 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,201 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:44,203 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:56:44,204 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 16:56:44,208 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:56:44,209 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 16:56:44,210 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 16:56:44,211 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 16:56:44,214 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 16:56:44,216 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 16:56:44,222 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 18, 5, 15, 5, 11, 5, 8, 5, 5, 5, 2, 5, 1] term [2020-12-09 16:56:44,223 INFO L639 QuantifierPusher]: Distributing 18 conjuncts over 2 disjuncts [2020-12-09 16:56:44,224 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 5, 2, 5, 1] term [2020-12-09 16:56:44,224 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 16:56:44,224 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2020-12-09 16:56:44,225 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,226 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 15, 5, 11, 5, 8, 5, 5, 5, 2, 5, 1] term [2020-12-09 16:56:44,226 INFO L639 QuantifierPusher]: Distributing 15 conjuncts over 2 disjuncts [2020-12-09 16:56:44,227 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 8, 5, 5, 5, 2, 5, 1] term [2020-12-09 16:56:44,227 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 2 disjuncts [2020-12-09 16:56:44,228 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 11, 5, 8, 5, 5, 5, 2, 5, 1] term [2020-12-09 16:56:44,229 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 2 disjuncts [2020-12-09 16:56:44,230 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 11, 5, 8, 5, 5, 5, 2, 5, 1] term [2020-12-09 16:56:44,230 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 2 disjuncts [2020-12-09 16:56:44,231 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 18, 5, 15, 5, 11, 5, 8, 5, 5, 5, 2, 5, 1] term [2020-12-09 16:56:44,232 INFO L639 QuantifierPusher]: Distributing 18 conjuncts over 2 disjuncts [2020-12-09 16:56:44,234 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 5, 2, 5, 1] term [2020-12-09 16:56:44,234 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 16:56:44,253 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2020-12-09 16:56:44,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,254 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 1] term [2020-12-09 16:56:44,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,255 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 8, 5, 5, 5, 2, 5, 1] term [2020-12-09 16:56:44,255 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 2 disjuncts [2020-12-09 16:56:44,256 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 5, 5, 2, 5, 1] term [2020-12-09 16:56:44,256 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,257 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 11, 5, 8, 5, 5, 5, 2, 5, 1] term [2020-12-09 16:56:44,257 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 3 disjuncts [2020-12-09 16:56:44,258 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 8, 5, 5, 5, 2, 5, 1] term [2020-12-09 16:56:44,258 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 3 disjuncts [2020-12-09 16:56:44,259 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 15, 5, 11, 5, 8, 5, 5, 5, 2, 5, 1] term [2020-12-09 16:56:44,260 INFO L639 QuantifierPusher]: Distributing 15 conjuncts over 3 disjuncts [2020-12-09 16:56:44,260 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 11, 5, 8, 5, 5, 5, 2, 5, 1] term [2020-12-09 16:56:44,261 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 3 disjuncts [2020-12-09 16:56:44,262 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 15, 5, 11, 5, 8, 5, 5, 5, 2, 5, 1] term [2020-12-09 16:56:44,262 INFO L639 QuantifierPusher]: Distributing 15 conjuncts over 2 disjuncts [2020-12-09 16:56:44,263 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 11, 5, 8, 5, 5, 5, 2, 5, 1] term [2020-12-09 16:56:44,263 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 2 disjuncts [2020-12-09 16:56:44,265 INFO L639 QuantifierPusher]: Distributing 22 conjuncts over 2 disjuncts [2020-12-09 16:56:44,265 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 16:56:44,266 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 16:56:44,267 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 16:56:44,270 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,273 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 16:56:44,275 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,277 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,278 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,280 INFO L639 QuantifierPusher]: Distributing 13 conjuncts over 2 disjuncts [2020-12-09 16:56:44,281 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,282 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,283 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,285 INFO L639 QuantifierPusher]: Distributing 9 conjuncts over 3 disjuncts [2020-12-09 16:56:44,287 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,288 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,290 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,293 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 16:56:44,293 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,296 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,298 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 16:56:44,301 INFO L639 QuantifierPusher]: Distributing 9 conjuncts over 2 disjuncts [2020-12-09 16:56:44,302 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,303 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,304 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,307 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,308 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 16:56:44,309 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,311 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,313 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,315 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,316 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,318 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,321 INFO L639 QuantifierPusher]: Distributing 9 conjuncts over 3 disjuncts [2020-12-09 16:56:44,322 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,324 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,325 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,327 INFO L639 QuantifierPusher]: Distributing 13 conjuncts over 3 disjuncts [2020-12-09 16:56:44,328 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,329 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,331 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,332 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,334 INFO L639 QuantifierPusher]: Distributing 9 conjuncts over 3 disjuncts [2020-12-09 16:56:44,335 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,337 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,338 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,340 INFO L639 QuantifierPusher]: Distributing 9 conjuncts over 3 disjuncts [2020-12-09 16:56:44,342 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,343 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,344 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,346 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,347 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 16:56:44,348 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,350 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,352 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 16:56:44,353 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 16:56:44,356 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,358 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 16:56:44,360 INFO L639 QuantifierPusher]: Distributing 9 conjuncts over 2 disjuncts [2020-12-09 16:56:44,361 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,362 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,364 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,366 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,368 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 16:56:44,368 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,371 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,374 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 16:56:44,375 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,376 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,378 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,379 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,380 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,382 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,384 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,385 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,387 INFO L639 QuantifierPusher]: Distributing 18 conjuncts over 3 disjuncts [2020-12-09 16:56:44,387 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,389 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,390 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,392 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,393 INFO L639 QuantifierPusher]: Distributing 9 conjuncts over 3 disjuncts [2020-12-09 16:56:44,395 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,396 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,397 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,399 INFO L639 QuantifierPusher]: Distributing 13 conjuncts over 3 disjuncts [2020-12-09 16:56:44,400 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,402 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,403 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,405 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,407 INFO L639 QuantifierPusher]: Distributing 9 conjuncts over 3 disjuncts [2020-12-09 16:56:44,408 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,409 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,410 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,411 INFO L639 QuantifierPusher]: Distributing 9 conjuncts over 3 disjuncts [2020-12-09 16:56:44,412 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,413 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,414 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,415 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,416 INFO L639 QuantifierPusher]: Distributing 9 conjuncts over 3 disjuncts [2020-12-09 16:56:44,417 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,418 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,420 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,421 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,423 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,425 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,426 INFO L639 QuantifierPusher]: Distributing 18 conjuncts over 2 disjuncts [2020-12-09 16:56:44,427 INFO L639 QuantifierPusher]: Distributing 13 conjuncts over 2 disjuncts [2020-12-09 16:56:44,427 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,429 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,433 INFO L639 QuantifierPusher]: Distributing 9 conjuncts over 3 disjuncts [2020-12-09 16:56:44,435 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,436 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,437 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,440 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 16:56:44,440 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,444 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 16:56:44,446 INFO L639 QuantifierPusher]: Distributing 9 conjuncts over 2 disjuncts [2020-12-09 16:56:44,447 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,448 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,449 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,451 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,453 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 16:56:44,453 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,456 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,457 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,459 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,461 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,462 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,464 INFO L639 QuantifierPusher]: Distributing 9 conjuncts over 3 disjuncts [2020-12-09 16:56:44,466 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,467 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,468 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,469 INFO L639 QuantifierPusher]: Distributing 13 conjuncts over 3 disjuncts [2020-12-09 16:56:44,470 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,471 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,472 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,473 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,474 INFO L639 QuantifierPusher]: Distributing 9 conjuncts over 3 disjuncts [2020-12-09 16:56:44,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,476 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,477 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,478 INFO L639 QuantifierPusher]: Distributing 9 conjuncts over 3 disjuncts [2020-12-09 16:56:44,480 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,481 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,482 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,484 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,485 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 16:56:44,485 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,487 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,489 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 16:56:44,490 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 16:56:44,491 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,493 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 16:56:44,494 INFO L639 QuantifierPusher]: Distributing 9 conjuncts over 2 disjuncts [2020-12-09 16:56:44,495 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,496 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,497 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,499 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,500 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 16:56:44,501 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:56:44,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,504 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,505 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,506 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,507 INFO L639 QuantifierPusher]: Distributing 17 conjuncts over 2 disjuncts [2020-12-09 16:56:44,508 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,509 INFO L639 QuantifierPusher]: Distributing 14 conjuncts over 3 disjuncts [2020-12-09 16:56:44,509 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:44,510 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,512 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,513 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,514 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,515 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,516 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,518 INFO L639 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-12-09 16:56:44,518 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:44,518 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,520 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,521 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,522 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 16:56:44,522 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:44,523 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,524 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,525 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,526 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 16:56:44,527 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:44,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,529 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,530 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,531 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:44,531 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,532 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,533 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,535 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 16:56:44,535 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,536 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,537 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,538 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,540 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:44,540 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,543 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 16:56:44,543 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,544 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,545 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,546 INFO L639 QuantifierPusher]: Distributing 10 conjuncts over 3 disjuncts [2020-12-09 16:56:44,547 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:44,547 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,548 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,550 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,551 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 16:56:44,551 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:44,551 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,554 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,555 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 16:56:44,555 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 16:56:44,556 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:56:44,558 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:56:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:56:44,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:56:44,910 WARN L197 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 2659 DAG size of output: 1218 [2020-12-09 16:56:44,926 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2020-12-09 16:56:44,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [877512583] [2020-12-09 16:56:44,941 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2020-12-09 16:56:44,942 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 16:56:44,945 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 16:56:44,949 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 16:56:44,949 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 16:56:45,075 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2020-12-09 16:56:45,508 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2020-12-09 16:56:46,472 WARN L197 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 2504 DAG size of output: 2363 [2020-12-09 16:57:01,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-12-09 16:57:01,366 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: variable got div captured at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:426) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$IDerHelper.findBestReplacementSbr(DualJunctionDer.java:305) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$IDerHelper.tryToEliminateSbr(DualJunctionDer.java:319) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:190) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:141) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryToEliminate(DualJunctionDer.java:119) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:776) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:739) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:656) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:358) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.doit(QuantifierPusher.java:523) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:378) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.doit(QuantifierPusher.java:523) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:378) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.eliminate(QuantifierPusher.java:151) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.eliminate(QuantifierPusher.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elimPushPull(PartialQuantifierElimination.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elimPushPull(PartialQuantifierElimination.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpretForSingleMarker(DagInterpreter.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarizeInternal(FixpointLoopSummarizer.java:118) at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1133) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 16:57:01,372 INFO L168 Benchmark]: Toolchain (without parser) took 29526.58 ms. Allocated memory was 109.1 MB in the beginning and 861.9 MB in the end (delta: 752.9 MB). Free memory was 69.6 MB in the beginning and 464.8 MB in the end (delta: -395.3 MB). Peak memory consumption was 593.6 MB. Max. memory is 16.1 GB. [2020-12-09 16:57:01,372 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 109.1 MB. Free memory is still 88.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 16:57:01,373 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.71 ms. Allocated memory is still 109.1 MB. Free memory was 69.4 MB in the beginning and 63.6 MB in the end (delta: 5.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-09 16:57:01,373 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.73 ms. Allocated memory is still 109.1 MB. Free memory was 63.6 MB in the beginning and 54.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-09 16:57:01,374 INFO L168 Benchmark]: Boogie Preprocessor took 50.37 ms. Allocated memory is still 109.1 MB. Free memory was 54.0 MB in the beginning and 48.0 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-09 16:57:01,374 INFO L168 Benchmark]: RCFGBuilder took 10634.63 ms. Allocated memory was 109.1 MB in the beginning and 327.2 MB in the end (delta: 218.1 MB). Free memory was 47.5 MB in the beginning and 62.8 MB in the end (delta: -15.3 MB). Peak memory consumption was 218.1 MB. Max. memory is 16.1 GB. [2020-12-09 16:57:01,375 INFO L168 Benchmark]: TraceAbstraction took 18388.94 ms. Allocated memory was 327.2 MB in the beginning and 861.9 MB in the end (delta: 534.8 MB). Free memory was 61.8 MB in the beginning and 464.8 MB in the end (delta: -403.1 MB). Peak memory consumption was 368.7 MB. Max. memory is 16.1 GB. [2020-12-09 16:57:01,378 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.19 ms. Allocated memory is still 109.1 MB. Free memory is still 88.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 383.71 ms. Allocated memory is still 109.1 MB. Free memory was 69.4 MB in the beginning and 63.6 MB in the end (delta: 5.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 64.73 ms. Allocated memory is still 109.1 MB. Free memory was 63.6 MB in the beginning and 54.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 50.37 ms. Allocated memory is still 109.1 MB. Free memory was 54.0 MB in the beginning and 48.0 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 10634.63 ms. Allocated memory was 109.1 MB in the beginning and 327.2 MB in the end (delta: 218.1 MB). Free memory was 47.5 MB in the beginning and 62.8 MB in the end (delta: -15.3 MB). Peak memory consumption was 218.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 18388.94 ms. Allocated memory was 327.2 MB in the beginning and 861.9 MB in the end (delta: 534.8 MB). Free memory was 61.8 MB in the beginning and 464.8 MB in the end (delta: -403.1 MB). Peak memory consumption was 368.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: variable got div captured de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: variable got div captured: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:426) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-7b2dab5 [2020-12-09 16:57:02,889 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 16:57:02,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 16:57:02,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 16:57:02,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 16:57:02,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 16:57:02,914 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 16:57:02,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 16:57:02,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 16:57:02,918 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 16:57:02,919 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 16:57:02,920 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 16:57:02,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 16:57:02,921 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 16:57:02,922 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 16:57:02,923 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 16:57:02,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 16:57:02,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 16:57:02,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 16:57:02,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 16:57:02,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 16:57:02,931 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 16:57:02,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 16:57:02,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 16:57:02,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 16:57:02,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 16:57:02,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 16:57:02,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 16:57:02,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 16:57:02,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 16:57:02,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 16:57:02,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 16:57:02,939 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 16:57:02,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 16:57:02,941 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 16:57:02,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 16:57:02,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 16:57:02,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 16:57:02,942 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 16:57:02,943 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 16:57:02,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 16:57:02,944 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2020-12-09 16:57:02,966 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 16:57:02,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 16:57:02,967 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 16:57:02,967 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 16:57:02,967 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 16:57:02,967 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 16:57:02,968 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 16:57:02,968 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 16:57:02,968 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 16:57:02,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 16:57:02,969 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 16:57:02,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 16:57:02,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 16:57:02,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 16:57:02,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 16:57:02,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 16:57:02,969 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 16:57:02,970 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 16:57:02,970 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 16:57:02,970 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 16:57:02,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 16:57:02,970 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 16:57:02,970 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 16:57:02,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 16:57:02,971 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 16:57:02,971 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 16:57:02,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 16:57:02,971 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 16:57:02,971 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 16:57:02,971 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 16:57:02,971 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 16:57:02,972 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 16:57:02,972 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 16:57:02,972 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 16:57:02,972 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 16:57:02,972 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/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-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan 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 -> Taipan 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 -> abd3e009209f6e7296872cfad9ad7f60b855cd93 [2020-12-09 16:57:03,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 16:57:03,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 16:57:03,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 16:57:03,224 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 16:57:03,225 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 16:57:03,226 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem14_label31.c [2020-12-09 16:57:03,269 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/data/8749f9dbe/a1efff3a79964dc59883c6c8cc8e8692/FLAGcea6378c9 [2020-12-09 16:57:03,743 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 16:57:03,744 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/sv-benchmarks/c/eca-rers2012/Problem14_label31.c [2020-12-09 16:57:03,755 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/data/8749f9dbe/a1efff3a79964dc59883c6c8cc8e8692/FLAGcea6378c9 [2020-12-09 16:57:03,768 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/data/8749f9dbe/a1efff3a79964dc59883c6c8cc8e8692 [2020-12-09 16:57:03,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 16:57:03,772 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 16:57:03,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 16:57:03,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 16:57:03,776 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 16:57:03,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:57:03" (1/1) ... [2020-12-09 16:57:03,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7375bb76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:57:03, skipping insertion in model container [2020-12-09 16:57:03,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:57:03" (1/1) ... [2020-12-09 16:57:03,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 16:57:03,827 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 16:57:03,985 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/sv-benchmarks/c/eca-rers2012/Problem14_label31.c[2583,2596] [2020-12-09 16:57:04,170 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 16:57:04,179 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 16:57:04,192 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/sv-benchmarks/c/eca-rers2012/Problem14_label31.c[2583,2596] [2020-12-09 16:57:04,272 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 16:57:04,283 INFO L208 MainTranslator]: Completed translation [2020-12-09 16:57:04,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:57:04 WrapperNode [2020-12-09 16:57:04,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 16:57:04,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 16:57:04,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 16:57:04,285 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 16:57:04,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:57:04" (1/1) ... [2020-12-09 16:57:04,308 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:57:04" (1/1) ... [2020-12-09 16:57:04,343 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 16:57:04,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 16:57:04,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 16:57:04,344 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 16:57:04,350 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:57:04" (1/1) ... [2020-12-09 16:57:04,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:57:04" (1/1) ... [2020-12-09 16:57:04,355 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:57:04" (1/1) ... [2020-12-09 16:57:04,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:57:04" (1/1) ... [2020-12-09 16:57:04,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:57:04" (1/1) ... [2020-12-09 16:57:04,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:57:04" (1/1) ... [2020-12-09 16:57:04,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:57:04" (1/1) ... [2020-12-09 16:57:04,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 16:57:04,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 16:57:04,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 16:57:04,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 16:57:04,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:57:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 16:57:04,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-09 16:57:04,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 16:57:04,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 16:57:04,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 16:57:06,794 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 16:57:06,794 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-09 16:57:06,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:57:06 BoogieIcfgContainer [2020-12-09 16:57:06,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 16:57:06,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 16:57:06,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 16:57:06,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 16:57:06,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:57:03" (1/3) ... [2020-12-09 16:57:06,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56050648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:57:06, skipping insertion in model container [2020-12-09 16:57:06,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:57:04" (2/3) ... [2020-12-09 16:57:06,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56050648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:57:06, skipping insertion in model container [2020-12-09 16:57:06,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:57:06" (3/3) ... [2020-12-09 16:57:06,802 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem14_label31.c [2020-12-09 16:57:06,815 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 16:57:06,819 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 16:57:06,826 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 16:57:06,846 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 16:57:06,846 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 16:57:06,846 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 16:57:06,846 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 16:57:06,847 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 16:57:06,847 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 16:57:06,847 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 16:57:06,847 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 16:57:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2020-12-09 16:57:06,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 16:57:06,865 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:57:06,866 INFO L422 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] [2020-12-09 16:57:06,866 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:57:06,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:57:06,870 INFO L82 PathProgramCache]: Analyzing trace with hash -573341295, now seen corresponding path program 1 times [2020-12-09 16:57:06,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:57:06,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151068269] [2020-12-09 16:57:06,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-12-09 16:57:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:57:06,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 16:57:06,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:57:06,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:57:06,999 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:57:07,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1151068269] [2020-12-09 16:57:07,000 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:57:07,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 16:57:07,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873856413] [2020-12-09 16:57:07,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:57:07,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:57:07,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:57:07,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:57:07,014 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 3 states. [2020-12-09 16:57:10,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:57:10,117 INFO L93 Difference]: Finished difference Result 685 states and 1216 transitions. [2020-12-09 16:57:10,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:57:10,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-12-09 16:57:10,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:57:10,128 INFO L225 Difference]: With dead ends: 685 [2020-12-09 16:57:10,128 INFO L226 Difference]: Without dead ends: 360 [2020-12-09 16:57:10,131 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:57:10,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2020-12-09 16:57:10,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2020-12-09 16:57:10,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2020-12-09 16:57:10,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 510 transitions. [2020-12-09 16:57:10,170 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 510 transitions. Word has length 23 [2020-12-09 16:57:10,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:57:10,171 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 510 transitions. [2020-12-09 16:57:10,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:57:10,171 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 510 transitions. [2020-12-09 16:57:10,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-09 16:57:10,174 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:57:10,174 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 16:57:10,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 16:57:10,375 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:57:10,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:57:10,375 INFO L82 PathProgramCache]: Analyzing trace with hash -302367706, now seen corresponding path program 1 times [2020-12-09 16:57:10,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:57:10,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409204354] [2020-12-09 16:57:10,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-12-09 16:57:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:57:10,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 16:57:10,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:57:10,585 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:57:10,586 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:57:10,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409204354] [2020-12-09 16:57:10,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:57:10,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 16:57:10,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195180835] [2020-12-09 16:57:10,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:57:10,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:57:10,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:57:10,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:57:10,588 INFO L87 Difference]: Start difference. First operand 360 states and 510 transitions. Second operand 3 states. [2020-12-09 16:57:13,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:57:13,008 INFO L93 Difference]: Finished difference Result 896 states and 1232 transitions. [2020-12-09 16:57:13,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:57:13,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2020-12-09 16:57:13,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:57:13,012 INFO L225 Difference]: With dead ends: 896 [2020-12-09 16:57:13,012 INFO L226 Difference]: Without dead ends: 538 [2020-12-09 16:57:13,013 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:57:13,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-12-09 16:57:13,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2020-12-09 16:57:13,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2020-12-09 16:57:13,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 700 transitions. [2020-12-09 16:57:13,033 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 700 transitions. Word has length 92 [2020-12-09 16:57:13,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:57:13,033 INFO L481 AbstractCegarLoop]: Abstraction has 538 states and 700 transitions. [2020-12-09 16:57:13,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:57:13,034 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 700 transitions. [2020-12-09 16:57:13,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-12-09 16:57:13,039 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:57:13,040 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-09 16:57:13,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 16:57:13,241 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:57:13,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:57:13,244 INFO L82 PathProgramCache]: Analyzing trace with hash -717468608, now seen corresponding path program 1 times [2020-12-09 16:57:13,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:57:13,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130390936] [2020-12-09 16:57:13,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-12-09 16:57:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:57:13,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 16:57:13,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:57:13,463 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:57:13,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:57:13,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130390936] [2020-12-09 16:57:13,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:57:13,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 16:57:13,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750638784] [2020-12-09 16:57:13,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:57:13,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:57:13,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:57:13,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:57:13,465 INFO L87 Difference]: Start difference. First operand 538 states and 700 transitions. Second operand 3 states. [2020-12-09 16:57:16,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:57:16,907 INFO L93 Difference]: Finished difference Result 1252 states and 1691 transitions. [2020-12-09 16:57:16,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:57:16,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2020-12-09 16:57:16,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:57:16,913 INFO L225 Difference]: With dead ends: 1252 [2020-12-09 16:57:16,913 INFO L226 Difference]: Without dead ends: 894 [2020-12-09 16:57:16,914 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:57:16,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2020-12-09 16:57:16,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2020-12-09 16:57:16,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2020-12-09 16:57:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1110 transitions. [2020-12-09 16:57:16,936 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1110 transitions. Word has length 128 [2020-12-09 16:57:16,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:57:16,937 INFO L481 AbstractCegarLoop]: Abstraction has 894 states and 1110 transitions. [2020-12-09 16:57:16,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:57:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1110 transitions. [2020-12-09 16:57:16,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2020-12-09 16:57:16,941 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:57:16,942 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:57:17,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 16:57:17,143 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:57:17,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:57:17,145 INFO L82 PathProgramCache]: Analyzing trace with hash -29386061, now seen corresponding path program 1 times [2020-12-09 16:57:17,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:57:17,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651096867] [2020-12-09 16:57:17,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-12-09 16:57:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:57:17,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 16:57:17,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:57:17,438 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:57:17,438 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:57:17,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651096867] [2020-12-09 16:57:17,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:57:17,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 16:57:17,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517712323] [2020-12-09 16:57:17,440 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:57:17,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:57:17,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:57:17,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:57:17,441 INFO L87 Difference]: Start difference. First operand 894 states and 1110 transitions. Second operand 4 states. [2020-12-09 16:57:19,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:57:19,806 INFO L93 Difference]: Finished difference Result 1281 states and 1659 transitions. [2020-12-09 16:57:19,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 16:57:19,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2020-12-09 16:57:19,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:57:19,810 INFO L225 Difference]: With dead ends: 1281 [2020-12-09 16:57:19,810 INFO L226 Difference]: Without dead ends: 716 [2020-12-09 16:57:19,811 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 16:57:19,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2020-12-09 16:57:19,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2020-12-09 16:57:19,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2020-12-09 16:57:19,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 881 transitions. [2020-12-09 16:57:19,822 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 881 transitions. Word has length 172 [2020-12-09 16:57:19,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:57:19,822 INFO L481 AbstractCegarLoop]: Abstraction has 716 states and 881 transitions. [2020-12-09 16:57:19,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:57:19,822 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 881 transitions. [2020-12-09 16:57:19,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2020-12-09 16:57:19,825 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:57:19,825 INFO L422 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 16:57:20,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-09 16:57:20,026 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:57:20,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:57:20,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1310544540, now seen corresponding path program 1 times [2020-12-09 16:57:20,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:57:20,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1233459608] [2020-12-09 16:57:20,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-12-09 16:57:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:57:20,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 16:57:20,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:57:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 62 proven. 131 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-12-09 16:57:20,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:57:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-12-09 16:57:21,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1233459608] [2020-12-09 16:57:21,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 16:57:21,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-12-09 16:57:21,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571100019] [2020-12-09 16:57:21,387 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:57:21,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:57:21,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:57:21,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:57:21,388 INFO L87 Difference]: Start difference. First operand 716 states and 881 transitions. Second operand 3 states. [2020-12-09 16:57:27,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:57:27,058 INFO L93 Difference]: Finished difference Result 1430 states and 1920 transitions. [2020-12-09 16:57:27,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:57:27,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2020-12-09 16:57:27,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:57:27,062 INFO L225 Difference]: With dead ends: 1430 [2020-12-09 16:57:27,063 INFO L226 Difference]: Without dead ends: 1072 [2020-12-09 16:57:27,063 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 594 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:57:27,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2020-12-09 16:57:27,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2020-12-09 16:57:27,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2020-12-09 16:57:27,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1370 transitions. [2020-12-09 16:57:27,079 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1370 transitions. Word has length 300 [2020-12-09 16:57:27,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:57:27,079 INFO L481 AbstractCegarLoop]: Abstraction has 1072 states and 1370 transitions. [2020-12-09 16:57:27,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:57:27,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1370 transitions. [2020-12-09 16:57:27,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2020-12-09 16:57:27,085 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:57:27,085 INFO L422 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 16:57:27,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-09 16:57:27,286 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:57:27,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:57:27,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1868063199, now seen corresponding path program 1 times [2020-12-09 16:57:27,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:57:27,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388933186] [2020-12-09 16:57:27,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-12-09 16:57:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:57:27,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 16:57:27,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:57:27,714 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 62 proven. 135 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-12-09 16:57:27,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:57:28,485 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-12-09 16:57:28,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388933186] [2020-12-09 16:57:28,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 16:57:28,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-12-09 16:57:28,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297006653] [2020-12-09 16:57:28,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:57:28,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:57:28,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:57:28,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:57:28,487 INFO L87 Difference]: Start difference. First operand 1072 states and 1370 transitions. Second operand 3 states. [2020-12-09 16:57:35,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:57:35,390 INFO L93 Difference]: Finished difference Result 2320 states and 3161 transitions. [2020-12-09 16:57:35,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:57:35,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2020-12-09 16:57:35,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:57:35,396 INFO L225 Difference]: With dead ends: 2320 [2020-12-09 16:57:35,396 INFO L226 Difference]: Without dead ends: 1606 [2020-12-09 16:57:35,397 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 598 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 16:57:35,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2020-12-09 16:57:35,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2020-12-09 16:57:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1606 states. [2020-12-09 16:57:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2030 transitions. [2020-12-09 16:57:35,422 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2030 transitions. Word has length 302 [2020-12-09 16:57:35,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:57:35,422 INFO L481 AbstractCegarLoop]: Abstraction has 1606 states and 2030 transitions. [2020-12-09 16:57:35,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:57:35,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2030 transitions. [2020-12-09 16:57:35,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2020-12-09 16:57:35,424 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:57:35,424 INFO L422 BasicCegarLoop]: trace histogram [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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:57:35,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-09 16:57:35,625 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:57:35,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:57:35,625 INFO L82 PathProgramCache]: Analyzing trace with hash -230744046, now seen corresponding path program 1 times [2020-12-09 16:57:35,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:57:35,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458432388] [2020-12-09 16:57:35,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-12-09 16:57:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:57:35,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 16:57:35,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:57:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2020-12-09 16:57:36,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:57:36,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458432388] [2020-12-09 16:57:36,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 16:57:36,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 16:57:36,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466244667] [2020-12-09 16:57:36,023 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:57:36,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:57:36,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:57:36,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:57:36,024 INFO L87 Difference]: Start difference. First operand 1606 states and 2030 transitions. Second operand 3 states. [2020-12-09 16:57:39,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:57:39,502 INFO L93 Difference]: Finished difference Result 3388 states and 4444 transitions. [2020-12-09 16:57:39,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:57:39,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 407 [2020-12-09 16:57:39,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:57:39,510 INFO L225 Difference]: With dead ends: 3388 [2020-12-09 16:57:39,510 INFO L226 Difference]: Without dead ends: 2140 [2020-12-09 16:57:39,511 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 16:57:39,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2020-12-09 16:57:39,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2140. [2020-12-09 16:57:39,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2020-12-09 16:57:39,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2666 transitions. [2020-12-09 16:57:39,542 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2666 transitions. Word has length 407 [2020-12-09 16:57:39,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:57:39,542 INFO L481 AbstractCegarLoop]: Abstraction has 2140 states and 2666 transitions. [2020-12-09 16:57:39,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:57:39,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2666 transitions. [2020-12-09 16:57:39,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2020-12-09 16:57:39,544 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:57:39,545 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:57:39,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-12-09 16:57:39,746 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:57:39,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:57:39,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1590142469, now seen corresponding path program 1 times [2020-12-09 16:57:39,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:57:39,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405865154] [2020-12-09 16:57:39,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-12-09 16:57:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:57:39,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 16:57:39,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:57:40,450 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 290 proven. 277 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-12-09 16:57:40,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:57:41,950 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 538 proven. 29 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-12-09 16:57:41,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405865154] [2020-12-09 16:57:41,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [264673259] [2020-12-09 16:57:41,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt [2020-12-09 16:57:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:57:42,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 16:57:42,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:57:42,492 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 16:57:42,493 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:57:42,493 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:57:42,497 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:57:42,500 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:57:42,500 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:57:42,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 16:57:42,505 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:57:42,506 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 16:57:42,706 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 355 proven. 21 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2020-12-09 16:57:42,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:57:42,919 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 16:57:42,920 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 16:57:43,225 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 355 proven. 21 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2020-12-09 16:57:43,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462073096] [2020-12-09 16:57:43,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:57:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:57:43,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 16:57:43,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:57:43,869 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 232 proven. 144 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2020-12-09 16:57:43,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:57:44,300 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 232 proven. 144 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2020-12-09 16:57:44,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 16:57:44,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 7, 7, 4, 4] total 18 [2020-12-09 16:57:44,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308120547] [2020-12-09 16:57:44,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-09 16:57:44,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:57:44,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-09 16:57:44,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2020-12-09 16:57:44,304 INFO L87 Difference]: Start difference. First operand 2140 states and 2666 transitions. Second operand 18 states. [2020-12-09 16:57:45,813 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2020-12-09 16:57:47,299 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2020-12-09 16:57:58,524 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 17 [2020-12-09 16:57:59,180 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 17 [2020-12-09 16:58:16,664 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2020-12-09 16:58:20,590 WARN L197 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2020-12-09 16:58:21,646 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2020-12-09 16:58:48,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:58:48,826 INFO L93 Difference]: Finished difference Result 5961 states and 7555 transitions. [2020-12-09 16:58:48,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-09 16:58:48,829 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 429 [2020-12-09 16:58:48,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:58:48,841 INFO L225 Difference]: With dead ends: 5961 [2020-12-09 16:58:48,841 INFO L226 Difference]: Without dead ends: 3920 [2020-12-09 16:58:48,843 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2585 GetRequests, 2555 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2020-12-09 16:58:48,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2020-12-09 16:58:48,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3564. [2020-12-09 16:58:48,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2020-12-09 16:58:48,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3861 transitions. [2020-12-09 16:58:48,887 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3861 transitions. Word has length 429 [2020-12-09 16:58:48,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:58:48,887 INFO L481 AbstractCegarLoop]: Abstraction has 3564 states and 3861 transitions. [2020-12-09 16:58:48,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-09 16:58:48,887 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3861 transitions. [2020-12-09 16:58:48,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2020-12-09 16:58:48,890 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:58:48,891 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 16:58:49,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3,10 cvc4 --incremental --print-success --lang smt,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:58:49,493 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:58:49,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:58:49,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1418069067, now seen corresponding path program 1 times [2020-12-09 16:58:49,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:58:49,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108394048] [2020-12-09 16:58:49,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-12-09 16:58:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:58:49,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 16:58:49,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:58:50,765 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2020-12-09 16:58:50,952 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2020-12-09 16:58:51,044 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 6, 1] term [2020-12-09 16:58:51,044 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 7 disjuncts [2020-12-09 16:58:52,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1219 backedges. 0 proven. 1002 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2020-12-09 16:58:52,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:58:53,506 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 6, 2, 1] term [2020-12-09 16:58:53,507 INFO L639 QuantifierPusher]: Distributing 6 disjuncts over 7 conjuncts [2020-12-09 16:58:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1219 backedges. 671 proven. 331 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2020-12-09 16:58:56,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108394048] [2020-12-09 16:58:56,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [346890268] [2020-12-09 16:58:56,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt [2020-12-09 16:58:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:58:56,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 16:58:56,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:58:57,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1219 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2020-12-09 16:58:57,000 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:58:57,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 16:58:57,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11, 11] total 21 [2020-12-09 16:58:57,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275579009] [2020-12-09 16:58:57,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:58:57,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:58:57,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:58:57,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2020-12-09 16:58:57,002 INFO L87 Difference]: Start difference. First operand 3564 states and 3861 transitions. Second operand 3 states. [2020-12-09 16:58:58,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:58:58,762 INFO L93 Difference]: Finished difference Result 7660 states and 8458 transitions. [2020-12-09 16:58:58,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:58:58,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 677 [2020-12-09 16:58:58,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:58:58,777 INFO L225 Difference]: With dead ends: 7660 [2020-12-09 16:58:58,778 INFO L226 Difference]: Without dead ends: 4810 [2020-12-09 16:58:58,781 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2028 GetRequests, 1993 SyntacticMatches, 16 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2020-12-09 16:58:58,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2020-12-09 16:58:58,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4810. [2020-12-09 16:58:58,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2020-12-09 16:58:58,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5277 transitions. [2020-12-09 16:58:58,866 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5277 transitions. Word has length 677 [2020-12-09 16:58:58,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:58:58,867 INFO L481 AbstractCegarLoop]: Abstraction has 4810 states and 5277 transitions. [2020-12-09 16:58:58,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:58:58,867 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5277 transitions. [2020-12-09 16:58:58,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2020-12-09 16:58:58,874 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:58:58,874 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 16:58:59,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt,12 mathsat -unsat_core_generation=3 [2020-12-09 16:58:59,276 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:58:59,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:58:59,278 INFO L82 PathProgramCache]: Analyzing trace with hash -113547579, now seen corresponding path program 1 times [2020-12-09 16:58:59,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:58:59,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1668156002] [2020-12-09 16:58:59,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2020-12-09 16:58:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:58:59,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 16:58:59,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:59:00,722 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 6, 1] term [2020-12-09 16:59:00,722 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 7 disjuncts [2020-12-09 16:59:02,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1589 backedges. 0 proven. 1351 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2020-12-09 16:59:02,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:59:03,400 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 6, 2, 1] term [2020-12-09 16:59:03,400 INFO L639 QuantifierPusher]: Distributing 6 disjuncts over 7 conjuncts [2020-12-09 16:59:06,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1589 backedges. 812 proven. 539 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2020-12-09 16:59:06,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1668156002] [2020-12-09 16:59:06,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [864397728] [2020-12-09 16:59:06,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt [2020-12-09 16:59:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:59:06,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 16:59:06,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:59:07,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1589 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 1464 trivial. 0 not checked. [2020-12-09 16:59:07,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:59:07,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 16:59:07,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11, 11] total 22 [2020-12-09 16:59:07,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572539820] [2020-12-09 16:59:07,531 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 16:59:07,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:59:07,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 16:59:07,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2020-12-09 16:59:07,532 INFO L87 Difference]: Start difference. First operand 4810 states and 5277 transitions. Second operand 4 states. [2020-12-09 16:59:11,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:59:11,266 INFO L93 Difference]: Finished difference Result 10522 states and 11721 transitions. [2020-12-09 16:59:11,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 16:59:11,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 747 [2020-12-09 16:59:11,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:59:11,288 INFO L225 Difference]: With dead ends: 10522 [2020-12-09 16:59:11,288 INFO L226 Difference]: Without dead ends: 6426 [2020-12-09 16:59:11,291 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2240 GetRequests, 2206 SyntacticMatches, 13 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2020-12-09 16:59:11,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6426 states. [2020-12-09 16:59:11,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6426 to 6412. [2020-12-09 16:59:11,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6412 states. [2020-12-09 16:59:11,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6412 states to 6412 states and 7090 transitions. [2020-12-09 16:59:11,365 INFO L78 Accepts]: Start accepts. Automaton has 6412 states and 7090 transitions. Word has length 747 [2020-12-09 16:59:11,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:59:11,366 INFO L481 AbstractCegarLoop]: Abstraction has 6412 states and 7090 transitions. [2020-12-09 16:59:11,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:59:11,366 INFO L276 IsEmpty]: Start isEmpty. Operand 6412 states and 7090 transitions. [2020-12-09 16:59:11,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 766 [2020-12-09 16:59:11,370 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:59:11,371 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 16:59:11,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3,15 cvc4 --incremental --print-success --lang smt [2020-12-09 16:59:11,772 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:59:11,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:59:11,774 INFO L82 PathProgramCache]: Analyzing trace with hash -46269262, now seen corresponding path program 1 times [2020-12-09 16:59:11,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:59:11,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1178359775] [2020-12-09 16:59:11,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2020-12-09 16:59:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:59:12,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 16:59:12,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:59:13,183 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 6, 1] term [2020-12-09 16:59:13,184 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 7 disjuncts [2020-12-09 16:59:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1679 backedges. 0 proven. 1441 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2020-12-09 16:59:15,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:59:15,968 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 6, 2, 1] term [2020-12-09 16:59:15,968 INFO L639 QuantifierPusher]: Distributing 6 disjuncts over 7 conjuncts [2020-12-09 16:59:18,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1679 backedges. 866 proven. 575 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2020-12-09 16:59:18,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1178359775] [2020-12-09 16:59:18,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1926308619] [2020-12-09 16:59:18,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt [2020-12-09 16:59:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:59:19,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 16:59:19,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:59:19,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1679 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 1554 trivial. 0 not checked. [2020-12-09 16:59:19,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:59:19,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 16:59:19,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11, 11] total 21 [2020-12-09 16:59:19,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719893209] [2020-12-09 16:59:19,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 16:59:19,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:59:19,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 16:59:19,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2020-12-09 16:59:19,743 INFO L87 Difference]: Start difference. First operand 6412 states and 7090 transitions. Second operand 3 states. [2020-12-09 16:59:21,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:59:21,711 INFO L93 Difference]: Finished difference Result 13534 states and 15020 transitions. [2020-12-09 16:59:21,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 16:59:21,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 765 [2020-12-09 16:59:21,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:59:21,736 INFO L225 Difference]: With dead ends: 13534 [2020-12-09 16:59:21,736 INFO L226 Difference]: Without dead ends: 7658 [2020-12-09 16:59:21,741 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2292 GetRequests, 2260 SyntacticMatches, 13 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2020-12-09 16:59:21,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7658 states. [2020-12-09 16:59:21,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7658 to 7658. [2020-12-09 16:59:21,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7658 states. [2020-12-09 16:59:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7658 states to 7658 states and 8325 transitions. [2020-12-09 16:59:21,816 INFO L78 Accepts]: Start accepts. Automaton has 7658 states and 8325 transitions. Word has length 765 [2020-12-09 16:59:21,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:59:21,817 INFO L481 AbstractCegarLoop]: Abstraction has 7658 states and 8325 transitions. [2020-12-09 16:59:21,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 16:59:21,817 INFO L276 IsEmpty]: Start isEmpty. Operand 7658 states and 8325 transitions. [2020-12-09 16:59:21,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 768 [2020-12-09 16:59:21,822 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:59:21,822 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 16:59:22,223 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3,17 cvc4 --incremental --print-success --lang smt [2020-12-09 16:59:22,224 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:59:22,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:59:22,226 INFO L82 PathProgramCache]: Analyzing trace with hash 608262263, now seen corresponding path program 1 times [2020-12-09 16:59:22,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:59:22,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931762090] [2020-12-09 16:59:22,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2020-12-09 16:59:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:59:22,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 16:59:22,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:59:25,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1689 backedges. 553 proven. 898 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2020-12-09 16:59:25,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:59:26,019 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 6, 2, 1] term [2020-12-09 16:59:26,019 INFO L639 QuantifierPusher]: Distributing 6 disjuncts over 7 conjuncts [2020-12-09 16:59:29,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1689 backedges. 1183 proven. 268 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2020-12-09 16:59:29,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931762090] [2020-12-09 16:59:29,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [432315390] [2020-12-09 16:59:29,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt [2020-12-09 16:59:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:59:29,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 16:59:29,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:59:30,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1689 backedges. 0 proven. 1451 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2020-12-09 16:59:30,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:59:32,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1689 backedges. 850 proven. 601 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2020-12-09 16:59:32,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748361730] [2020-12-09 16:59:32,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:59:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:59:32,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 16:59:32,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:59:33,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1689 backedges. 125 proven. 1347 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2020-12-09 16:59:33,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:59:35,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1689 backedges. 934 proven. 538 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2020-12-09 16:59:35,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 16:59:35,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 5, 5, 5, 5] total 25 [2020-12-09 16:59:35,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770257143] [2020-12-09 16:59:35,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-12-09 16:59:35,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:59:35,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-12-09 16:59:35,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2020-12-09 16:59:35,120 INFO L87 Difference]: Start difference. First operand 7658 states and 8325 transitions. Second operand 25 states. [2020-12-09 16:59:56,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:59:56,811 INFO L93 Difference]: Finished difference Result 18856 states and 20790 transitions. [2020-12-09 16:59:56,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-09 16:59:56,811 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 767 [2020-12-09 16:59:56,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:59:56,826 INFO L225 Difference]: With dead ends: 18856 [2020-12-09 16:59:56,826 INFO L226 Difference]: Without dead ends: 12090 [2020-12-09 16:59:56,832 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4606 GetRequests, 4561 SyntacticMatches, 17 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2020-12-09 16:59:56,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12090 states. [2020-12-09 16:59:56,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12090 to 9429. [2020-12-09 16:59:56,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9429 states. [2020-12-09 16:59:56,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9429 states to 9429 states and 10324 transitions. [2020-12-09 16:59:56,932 INFO L78 Accepts]: Start accepts. Automaton has 9429 states and 10324 transitions. Word has length 767 [2020-12-09 16:59:56,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:59:56,933 INFO L481 AbstractCegarLoop]: Abstraction has 9429 states and 10324 transitions. [2020-12-09 16:59:56,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-12-09 16:59:56,933 INFO L276 IsEmpty]: Start isEmpty. Operand 9429 states and 10324 transitions. [2020-12-09 16:59:56,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 933 [2020-12-09 16:59:56,940 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:59:56,941 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 16:59:57,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3,19 cvc4 --incremental --print-success --lang smt,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 16:59:57,544 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:59:57,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:59:57,546 INFO L82 PathProgramCache]: Analyzing trace with hash 882280413, now seen corresponding path program 1 times [2020-12-09 16:59:57,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:59:57,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209548085] [2020-12-09 16:59:57,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2020-12-09 16:59:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:59:57,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 16:59:57,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:00:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2699 backedges. 1291 proven. 1115 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2020-12-09 17:00:00,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 17:00:01,679 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 6, 1] term [2020-12-09 17:00:01,679 INFO L639 QuantifierPusher]: Distributing 6 disjuncts over 7 conjuncts [2020-12-09 17:00:02,665 WARN L197 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2020-12-09 17:00:03,198 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2020-12-09 17:00:13,297 WARN L197 SmtUtils]: Spent 2.45 s on a formula simplification that was a NOOP. DAG size: 20 [2020-12-09 17:00:16,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2699 backedges. 1833 proven. 0 refuted. 573 times theorem prover too weak. 293 trivial. 0 not checked. [2020-12-09 17:00:16,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209548085] [2020-12-09 17:00:16,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [439369897] [2020-12-09 17:00:16,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt [2020-12-09 17:00:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:00:17,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 17:00:17,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:00:17,809 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 17:00:17,809 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 17:00:18,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2699 backedges. 742 proven. 21 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2020-12-09 17:00:18,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 17:00:19,230 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 17:00:19,230 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 17:00:19,230 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-12-09 17:00:19,234 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-12-09 17:00:19,237 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 17:00:19,237 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-12-09 17:00:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2699 backedges. 749 proven. 14 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2020-12-09 17:00:19,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663462043] [2020-12-09 17:00:19,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 17:00:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:00:20,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 17:00:20,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:00:21,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2699 backedges. 264 proven. 499 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2020-12-09 17:00:21,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 17:00:22,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2699 backedges. 264 proven. 499 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2020-12-09 17:00:22,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 17:00:22,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 7, 7, 4, 4] total 33 [2020-12-09 17:00:22,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664826485] [2020-12-09 17:00:22,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-12-09 17:00:22,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 17:00:22,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-12-09 17:00:22,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=831, Unknown=2, NotChecked=0, Total=1056 [2020-12-09 17:00:22,879 INFO L87 Difference]: Start difference. First operand 9429 states and 10324 transitions. Second operand 33 states. [2020-12-09 17:02:36,929 WARN L197 SmtUtils]: Spent 2.62 s on a formula simplification that was a NOOP. DAG size: 27 [2020-12-09 17:02:50,761 WARN L197 SmtUtils]: Spent 2.80 s on a formula simplification that was a NOOP. DAG size: 33 [2020-12-09 17:03:01,791 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2020-12-09 17:05:29,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:05:29,231 INFO L93 Difference]: Finished difference Result 19110 states and 20882 transitions. [2020-12-09 17:05:29,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-12-09 17:05:29,235 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 932 [2020-12-09 17:05:29,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:05:29,245 INFO L225 Difference]: With dead ends: 19110 [2020-12-09 17:05:29,245 INFO L226 Difference]: Without dead ends: 9779 [2020-12-09 17:05:29,251 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5601 GetRequests, 5541 SyntacticMatches, 20 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 31.8s TimeCoverageRelationStatistics Valid=323, Invalid=1394, Unknown=5, NotChecked=0, Total=1722 [2020-12-09 17:05:29,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9779 states. [2020-12-09 17:05:29,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9779 to 9145. [2020-12-09 17:05:29,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9145 states. [2020-12-09 17:05:29,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9145 states to 9145 states and 9981 transitions. [2020-12-09 17:05:29,337 INFO L78 Accepts]: Start accepts. Automaton has 9145 states and 9981 transitions. Word has length 932 [2020-12-09 17:05:29,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:05:29,337 INFO L481 AbstractCegarLoop]: Abstraction has 9145 states and 9981 transitions. [2020-12-09 17:05:29,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-12-09 17:05:29,338 INFO L276 IsEmpty]: Start isEmpty. Operand 9145 states and 9981 transitions. [2020-12-09 17:05:29,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1017 [2020-12-09 17:05:29,345 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:05:29,346 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 17:05:29,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3,22 cvc4 --incremental --print-success --lang smt,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 17:05:29,948 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:05:29,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:05:29,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1454150492, now seen corresponding path program 1 times [2020-12-09 17:05:29,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 17:05:29,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [329637897] [2020-12-09 17:05:29,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2020-12-09 17:05:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:05:30,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 17:05:30,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:05:31,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3374 backedges. 847 proven. 2135 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-12-09 17:05:31,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 17:05:33,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3374 backedges. 2327 proven. 82 refuted. 0 times theorem prover too weak. 965 trivial. 0 not checked. [2020-12-09 17:05:33,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [329637897] [2020-12-09 17:05:33,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1714436336] [2020-12-09 17:05:33,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt [2020-12-09 17:05:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:05:33,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 17:05:33,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:05:34,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 17:05:34,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 17:05:34,659 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 17:05:34,662 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 17:05:34,666 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 17:05:34,669 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 17:05:35,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3374 backedges. 847 proven. 21 refuted. 0 times theorem prover too weak. 2506 trivial. 0 not checked. [2020-12-09 17:05:35,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 17:05:35,779 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 17:05:35,780 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 17:05:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3374 backedges. 856 proven. 12 refuted. 0 times theorem prover too weak. 2506 trivial. 0 not checked. [2020-12-09 17:05:36,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471431192] [2020-12-09 17:05:36,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 17:05:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:05:36,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 17:05:36,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:05:38,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3374 backedges. 563 proven. 305 refuted. 0 times theorem prover too weak. 2506 trivial. 0 not checked. [2020-12-09 17:05:38,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 17:05:39,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3374 backedges. 563 proven. 305 refuted. 0 times theorem prover too weak. 2506 trivial. 0 not checked. [2020-12-09 17:05:39,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 17:05:39,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7, 7, 4, 4] total 21 [2020-12-09 17:05:39,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282227288] [2020-12-09 17:05:39,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-09 17:05:39,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 17:05:39,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-09 17:05:39,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-12-09 17:05:39,837 INFO L87 Difference]: Start difference. First operand 9145 states and 9981 transitions. Second operand 21 states. [2020-12-09 17:06:05,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:06:05,076 INFO L93 Difference]: Finished difference Result 19110 states and 20827 transitions. [2020-12-09 17:06:05,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-09 17:06:05,077 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1016 [2020-12-09 17:06:05,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:06:05,089 INFO L225 Difference]: With dead ends: 19110 [2020-12-09 17:06:05,089 INFO L226 Difference]: Without dead ends: 10107 [2020-12-09 17:06:05,095 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6112 GetRequests, 6078 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=201, Invalid=855, Unknown=0, NotChecked=0, Total=1056 [2020-12-09 17:06:05,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10107 states. [2020-12-09 17:06:05,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10107 to 8861. [2020-12-09 17:06:05,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8861 states. [2020-12-09 17:06:05,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8861 states to 8861 states and 9342 transitions. [2020-12-09 17:06:05,178 INFO L78 Accepts]: Start accepts. Automaton has 8861 states and 9342 transitions. Word has length 1016 [2020-12-09 17:06:05,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:06:05,179 INFO L481 AbstractCegarLoop]: Abstraction has 8861 states and 9342 transitions. [2020-12-09 17:06:05,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-12-09 17:06:05,179 INFO L276 IsEmpty]: Start isEmpty. Operand 8861 states and 9342 transitions. [2020-12-09 17:06:05,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1173 [2020-12-09 17:06:05,188 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:06:05,189 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 17:06:05,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 cvc4 --incremental --print-success --lang smt,24 mathsat -unsat_core_generation=3 [2020-12-09 17:06:05,791 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:06:05,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:06:05,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1797803028, now seen corresponding path program 1 times [2020-12-09 17:06:05,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 17:06:05,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132299291] [2020-12-09 17:06:05,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2020-12-09 17:06:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:06:06,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 1299 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 17:06:06,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:06:07,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4460 backedges. 2805 proven. 0 refuted. 0 times theorem prover too weak. 1655 trivial. 0 not checked. [2020-12-09 17:06:07,537 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 17:06:07,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132299291] [2020-12-09 17:06:07,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:06:07,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 17:06:07,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221132886] [2020-12-09 17:06:07,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 17:06:07,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 17:06:07,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 17:06:07,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 17:06:07,538 INFO L87 Difference]: Start difference. First operand 8861 states and 9342 transitions. Second operand 4 states. [2020-12-09 17:06:10,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:06:10,274 INFO L93 Difference]: Finished difference Result 16758 states and 17711 transitions. [2020-12-09 17:06:10,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 17:06:10,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1172 [2020-12-09 17:06:10,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:06:10,287 INFO L225 Difference]: With dead ends: 16758 [2020-12-09 17:06:10,287 INFO L226 Difference]: Without dead ends: 9039 [2020-12-09 17:06:10,292 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1171 GetRequests, 1169 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 17:06:10,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9039 states. [2020-12-09 17:06:10,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9039 to 9039. [2020-12-09 17:06:10,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9039 states. [2020-12-09 17:06:10,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9039 states to 9039 states and 9519 transitions. [2020-12-09 17:06:10,380 INFO L78 Accepts]: Start accepts. Automaton has 9039 states and 9519 transitions. Word has length 1172 [2020-12-09 17:06:10,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:06:10,381 INFO L481 AbstractCegarLoop]: Abstraction has 9039 states and 9519 transitions. [2020-12-09 17:06:10,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 17:06:10,381 INFO L276 IsEmpty]: Start isEmpty. Operand 9039 states and 9519 transitions. [2020-12-09 17:06:10,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1175 [2020-12-09 17:06:10,390 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:06:10,391 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 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, 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] [2020-12-09 17:06:10,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2020-12-09 17:06:10,592 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:06:10,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:06:10,593 INFO L82 PathProgramCache]: Analyzing trace with hash -731140232, now seen corresponding path program 1 times [2020-12-09 17:06:10,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 17:06:10,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453849214] [2020-12-09 17:06:10,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2020-12-09 17:06:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:06:10,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 1294 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 17:06:10,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:06:12,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 2667 proven. 0 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2020-12-09 17:06:12,421 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 17:06:12,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453849214] [2020-12-09 17:06:12,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 17:06:12,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 17:06:12,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852363616] [2020-12-09 17:06:12,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 17:06:12,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 17:06:12,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 17:06:12,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 17:06:12,423 INFO L87 Difference]: Start difference. First operand 9039 states and 9519 transitions. Second operand 4 states. [2020-12-09 17:06:15,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:06:15,323 INFO L93 Difference]: Finished difference Result 16936 states and 17885 transitions. [2020-12-09 17:06:15,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 17:06:15,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1174 [2020-12-09 17:06:15,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:06:15,330 INFO L225 Difference]: With dead ends: 16936 [2020-12-09 17:06:15,330 INFO L226 Difference]: Without dead ends: 9039 [2020-12-09 17:06:15,336 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1173 GetRequests, 1171 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 17:06:15,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9039 states. [2020-12-09 17:06:15,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9039 to 9039. [2020-12-09 17:06:15,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9039 states. [2020-12-09 17:06:15,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9039 states to 9039 states and 9518 transitions. [2020-12-09 17:06:15,413 INFO L78 Accepts]: Start accepts. Automaton has 9039 states and 9518 transitions. Word has length 1174 [2020-12-09 17:06:15,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:06:15,413 INFO L481 AbstractCegarLoop]: Abstraction has 9039 states and 9518 transitions. [2020-12-09 17:06:15,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 17:06:15,413 INFO L276 IsEmpty]: Start isEmpty. Operand 9039 states and 9518 transitions. [2020-12-09 17:06:15,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1180 [2020-12-09 17:06:15,422 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:06:15,423 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:06:15,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2020-12-09 17:06:15,625 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:06:15,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:06:15,626 INFO L82 PathProgramCache]: Analyzing trace with hash 159925968, now seen corresponding path program 1 times [2020-12-09 17:06:15,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 17:06:15,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431507744] [2020-12-09 17:06:15,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2020-12-09 17:06:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:06:16,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-09 17:06:16,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:06:16,755 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2020-12-09 17:06:16,978 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2020-12-09 17:06:17,222 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2020-12-09 17:06:17,540 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2020-12-09 17:06:17,782 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2020-12-09 17:06:17,797 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 6, 1] term [2020-12-09 17:06:17,797 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 7 disjuncts [2020-12-09 17:06:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4474 backedges. 399 proven. 3804 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2020-12-09 17:06:20,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 17:06:21,580 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2020-12-09 17:06:21,787 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 6, 3, 1] term [2020-12-09 17:06:21,787 INFO L639 QuantifierPusher]: Distributing 6 disjuncts over 7 conjuncts [2020-12-09 17:06:25,311 WARN L197 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 3 [2020-12-09 17:06:28,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4474 backedges. 2954 proven. 886 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2020-12-09 17:06:28,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431507744] [2020-12-09 17:06:28,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [332021109] [2020-12-09 17:06:28,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/cvc4 Starting monitored process 30 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --incremental --print-success --lang smt [2020-12-09 17:06:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:06:28,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-09 17:06:28,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:06:30,040 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-12-09 17:06:30,391 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2020-12-09 17:06:30,407 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 6 disjuncts [2020-12-09 17:06:30,408 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 5 disjuncts [2020-12-09 17:06:30,408 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 5 disjuncts [2020-12-09 17:06:30,408 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,409 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,409 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,412 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,417 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,418 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,418 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 17:06:30,421 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,427 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,427 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,431 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,437 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,437 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,438 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,440 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,443 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,444 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,447 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,452 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 4 disjuncts [2020-12-09 17:06:30,452 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,452 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 17:06:30,454 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 17:06:30,457 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,457 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 17:06:30,460 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,465 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,465 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,465 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 17:06:30,468 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,472 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,473 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,473 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 17:06:30,475 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,479 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,479 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,480 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,482 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 5 disjuncts [2020-12-09 17:06:30,483 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,483 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,483 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,486 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,491 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,492 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,492 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 17:06:30,495 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,498 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,498 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,501 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,505 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,506 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,506 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,509 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,510 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,510 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,512 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,514 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 6 disjuncts [2020-12-09 17:06:30,514 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 6 disjuncts [2020-12-09 17:06:30,514 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 6 disjuncts [2020-12-09 17:06:30,515 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,515 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,516 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,521 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,522 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,522 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,524 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,529 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 6 disjuncts [2020-12-09 17:06:30,530 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,530 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,530 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,532 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,534 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,534 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,537 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,541 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 6 disjuncts [2020-12-09 17:06:30,542 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,542 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,543 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,546 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 6 disjuncts [2020-12-09 17:06:30,547 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,548 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 6 disjuncts [2020-12-09 17:06:30,550 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 5 disjuncts [2020-12-09 17:06:30,550 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,551 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,551 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 17:06:30,554 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,559 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,559 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,562 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,568 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,568 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,569 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,570 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,573 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,573 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,575 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,580 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 6 disjuncts [2020-12-09 17:06:30,580 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 5 disjuncts [2020-12-09 17:06:30,581 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,581 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,581 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 17:06:30,584 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,587 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,587 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,590 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,595 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,595 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,595 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,596 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,599 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,599 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,601 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,606 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 6 disjuncts [2020-12-09 17:06:30,606 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 6 disjuncts [2020-12-09 17:06:30,606 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,607 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,608 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,613 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,613 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,614 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,616 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,622 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 6 disjuncts [2020-12-09 17:06:30,622 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,623 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,623 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,626 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 17:06:30,627 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,627 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,629 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,631 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 6 disjuncts [2020-12-09 17:06:30,631 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,631 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 17:06:30,633 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,635 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 6 disjuncts [2020-12-09 17:06:30,636 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 17:06:30,637 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 6 disjuncts [2020-12-09 17:06:32,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4474 backedges. 2216 proven. 220 refuted. 0 times theorem prover too weak. 2038 trivial. 0 not checked. [2020-12-09 17:06:32,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 17:06:33,531 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-09 17:06:33,532 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-09 17:06:33,532 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 17:06:33,532 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 17:06:33,535 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 17:06:33,537 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 17:06:33,540 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 17:06:33,540 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 17:06:33,543 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 17:06:33,545 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-09 17:06:33,545 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 17:06:33,545 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 17:06:33,547 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 17:06:33,550 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 17:06:33,552 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-12-09 17:06:33,553 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-12-09 17:06:33,556 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 17:06:33,559 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-12-09 17:06:35,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4474 backedges. 2281 proven. 155 refuted. 0 times theorem prover too weak. 2038 trivial. 0 not checked. [2020-12-09 17:06:35,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562633669] [2020-12-09 17:06:35,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 17:06:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 17:06:35,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 17:06:35,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 17:06:36,540 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 17:06:36,540 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 17:06:36,542 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 17:06:36,544 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 17:06:36,546 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 17:06:36,547 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 17:06:36,550 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 17:06:36,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 17:06:38,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4474 backedges. 2368 proven. 26 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2020-12-09 17:06:38,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 17:06:38,878 INFO L639 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-12-09 17:06:38,879 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-12-09 17:06:38,879 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-12-09 17:06:38,880 INFO L639 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-12-09 17:06:38,882 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-12-09 17:06:38,882 INFO L639 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-12-09 17:06:38,884 INFO L639 QuantifierPusher]: Distributing 5 disjuncts over 3 conjuncts [2020-12-09 17:06:38,887 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-12-09 17:06:38,887 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-12-09 17:06:38,887 INFO L639 QuantifierPusher]: Distributing 5 disjuncts over 3 conjuncts [2020-12-09 17:06:38,891 INFO L639 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-12-09 17:06:38,893 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-12-09 17:06:38,894 INFO L639 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-12-09 17:06:38,898 INFO L639 QuantifierPusher]: Distributing 5 disjuncts over 3 conjuncts [2020-12-09 17:06:38,901 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-12-09 17:06:38,901 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-12-09 17:06:38,901 INFO L639 QuantifierPusher]: Distributing 5 disjuncts over 3 conjuncts [2020-12-09 17:06:38,905 INFO L639 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-12-09 17:06:38,910 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-12-09 17:06:38,910 INFO L639 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-12-09 17:06:38,913 INFO L639 QuantifierPusher]: Distributing 5 disjuncts over 3 conjuncts [2020-12-09 17:06:40,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4474 backedges. 2118 proven. 276 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2020-12-09 17:06:40,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 17:06:40,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12, 9, 7, 7] total 46 [2020-12-09 17:06:40,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141862100] [2020-12-09 17:06:40,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 46 states [2020-12-09 17:06:40,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 17:06:40,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2020-12-09 17:06:40,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=1718, Unknown=0, NotChecked=0, Total=2070 [2020-12-09 17:06:40,921 INFO L87 Difference]: Start difference. First operand 9039 states and 9518 transitions. Second operand 46 states. [2020-12-09 17:06:41,224 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2020-12-09 17:06:47,633 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 36 [2020-12-09 17:06:56,903 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 27 [2020-12-09 17:06:58,803 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 26 [2020-12-09 17:06:59,361 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 26 [2020-12-09 17:06:59,699 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 21 [2020-12-09 17:07:00,057 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 19 [2020-12-09 17:07:00,589 WARN L197 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 35 [2020-12-09 17:07:00,888 WARN L197 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2020-12-09 17:07:01,868 WARN L197 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 39 [2020-12-09 17:07:02,208 WARN L197 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 35 [2020-12-09 17:07:03,347 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 31 [2020-12-09 17:07:03,728 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 27 [2020-12-09 17:07:04,064 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 22 [2020-12-09 17:07:05,053 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2020-12-09 17:07:05,475 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 35 [2020-12-09 17:07:07,092 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2020-12-09 17:07:08,600 WARN L197 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2020-12-09 17:07:08,907 WARN L197 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2020-12-09 17:07:20,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 17:07:20,758 INFO L93 Difference]: Finished difference Result 17654 states and 18640 transitions. [2020-12-09 17:07:20,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-12-09 17:07:20,759 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1179 [2020-12-09 17:07:20,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 17:07:20,766 INFO L225 Difference]: With dead ends: 17654 [2020-12-09 17:07:20,766 INFO L226 Difference]: Without dead ends: 9737 [2020-12-09 17:07:20,773 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7126 GetRequests, 7034 SyntacticMatches, 8 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2268 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=1344, Invalid=5966, Unknown=0, NotChecked=0, Total=7310 [2020-12-09 17:07:20,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9737 states. [2020-12-09 17:07:20,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9737 to 7123. [2020-12-09 17:07:20,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7123 states. [2020-12-09 17:07:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7123 states to 7123 states and 7301 transitions. [2020-12-09 17:07:20,851 INFO L78 Accepts]: Start accepts. Automaton has 7123 states and 7301 transitions. Word has length 1179 [2020-12-09 17:07:20,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 17:07:20,851 INFO L481 AbstractCegarLoop]: Abstraction has 7123 states and 7301 transitions. [2020-12-09 17:07:20,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2020-12-09 17:07:20,851 INFO L276 IsEmpty]: Start isEmpty. Operand 7123 states and 7301 transitions. [2020-12-09 17:07:20,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1472 [2020-12-09 17:07:20,868 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 17:07:20,869 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 17:07:21,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 cvc4 --incremental --print-success --lang smt,29 mathsat -unsat_core_generation=3,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 17:07:21,471 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 17:07:21,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 17:07:21,473 INFO L82 PathProgramCache]: Analyzing trace with hash 448266144, now seen corresponding path program 1 times [2020-12-09 17:07:21,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 17:07:21,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107459445] [2020-12-09 17:07:21,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2020-12-09 17:07:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 17:07:21,918 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 17:07:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 17:07:22,253 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 17:07:22,717 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-12-09 17:07:22,718 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 17:07:22,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3 [2020-12-09 17:07:23,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:07:23 BoogieIcfgContainer [2020-12-09 17:07:23,297 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 17:07:23,298 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 17:07:23,298 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 17:07:23,298 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 17:07:23,298 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:57:06" (3/4) ... [2020-12-09 17:07:23,299 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 17:07:23,647 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ab18d957-0d4d-4010-b4dd-44e8b844aa19/bin/utaipan/witness.graphml [2020-12-09 17:07:23,647 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 17:07:23,648 INFO L168 Benchmark]: Toolchain (without parser) took 619875.78 ms. Allocated memory was 65.0 MB in the beginning and 1.1 GB in the end (delta: 1.1 GB). Free memory was 46.3 MB in the beginning and 467.2 MB in the end (delta: -420.9 MB). Peak memory consumption was 645.0 MB. Max. memory is 16.1 GB. [2020-12-09 17:07:23,648 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 65.0 MB. Free memory is still 47.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 17:07:23,648 INFO L168 Benchmark]: CACSL2BoogieTranslator took 511.06 ms. Allocated memory was 65.0 MB in the beginning and 86.0 MB in the end (delta: 21.0 MB). Free memory was 45.9 MB in the beginning and 60.9 MB in the end (delta: -15.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 16.1 GB. [2020-12-09 17:07:23,649 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.19 ms. Allocated memory is still 86.0 MB. Free memory was 60.9 MB in the beginning and 54.4 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-09 17:07:23,649 INFO L168 Benchmark]: Boogie Preprocessor took 48.47 ms. Allocated memory is still 86.0 MB. Free memory was 54.4 MB in the beginning and 49.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 17:07:23,649 INFO L168 Benchmark]: RCFGBuilder took 2403.59 ms. Allocated memory was 86.0 MB in the beginning and 104.9 MB in the end (delta: 18.9 MB). Free memory was 49.1 MB in the beginning and 48.3 MB in the end (delta: 757.6 kB). Peak memory consumption was 22.4 MB. Max. memory is 16.1 GB. [2020-12-09 17:07:23,649 INFO L168 Benchmark]: TraceAbstraction took 616500.09 ms. Allocated memory was 104.9 MB in the beginning and 1.1 GB in the end (delta: 1.0 GB). Free memory was 48.3 MB in the beginning and 636.9 MB in the end (delta: -588.6 MB). Peak memory consumption was 438.2 MB. Max. memory is 16.1 GB. [2020-12-09 17:07:23,650 INFO L168 Benchmark]: Witness Printer took 349.76 ms. Allocated memory is still 1.1 GB. Free memory was 636.9 MB in the beginning and 467.2 MB in the end (delta: 169.8 MB). Peak memory consumption was 167.8 MB. Max. memory is 16.1 GB. [2020-12-09 17:07:23,651 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.11 ms. Allocated memory is still 65.0 MB. Free memory is still 47.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 511.06 ms. Allocated memory was 65.0 MB in the beginning and 86.0 MB in the end (delta: 21.0 MB). Free memory was 45.9 MB in the beginning and 60.9 MB in the end (delta: -15.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 58.19 ms. Allocated memory is still 86.0 MB. Free memory was 60.9 MB in the beginning and 54.4 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 48.47 ms. Allocated memory is still 86.0 MB. Free memory was 54.4 MB in the beginning and 49.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2403.59 ms. Allocated memory was 86.0 MB in the beginning and 104.9 MB in the end (delta: 18.9 MB). Free memory was 49.1 MB in the beginning and 48.3 MB in the end (delta: 757.6 kB). Peak memory consumption was 22.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 616500.09 ms. Allocated memory was 104.9 MB in the beginning and 1.1 GB in the end (delta: 1.0 GB). Free memory was 48.3 MB in the beginning and 636.9 MB in the end (delta: -588.6 MB). Peak memory consumption was 438.2 MB. Max. memory is 16.1 GB. * Witness Printer took 349.76 ms. Allocated memory is still 1.1 GB. Free memory was 636.9 MB in the beginning and 467.2 MB in the end (delta: 169.8 MB). Peak memory consumption was 167.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 83]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int inputD = 4; [L18] int inputB = 2; [L19] int inputC = 3; [L20] int inputF = 6; [L21] int inputE = 5; [L22] int inputA = 1; [L25] int a21 = 7; [L26] int a15 = 8; [L27] int a12 = -49; [L28] int a24 = 1; VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L887] int output = -1; VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L890] COND TRUE 1 [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L321] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L369] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L376] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L406] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L412] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) VAL [a12=4294967247, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND TRUE (((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8)) [L461] a21 = 10 [L463] return 22; VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] output = calculate_output(input) [L890] COND TRUE 1 [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L321] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L369] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L376] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L406] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L412] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) VAL [a12=4294967247, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND TRUE ((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8)) [L455] a12 = ((((a12 % 26)+ -1) / 5) / 5) [L456] a21 = 7 [L458] return 25; VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] output = calculate_output(input) [L890] COND TRUE 1 [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L321] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L369] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L376] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L406] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L412] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a15==9) && ((((a21==9) || (a21==10)) && (input == 4)) && ((-43 < a12) && (11 >= a12)) )) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 2))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L477] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (((a21==9) || (a21==10)) && (input == 3))) && (a15==9)) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L482] COND FALSE !((((a15==8) && ( 80 < a12 && (((a21==8) || (a21==9)) && (input == 6)))) && (a24==1))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L488] COND FALSE !((((((( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))) || ((a21==7) && ((-43 < a12) && (11 >= a12)) )) && (input == 3)) && (a24==1)) && (a15==9))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L494] COND FALSE !(((a24==1) && ((input == 1) && (((a21==10) && ((a15==8) && 80 < a12 )) || (( a12 <= -43 && (a15==9)) && (a21==6)))))) VAL [a12=0, a15=8, a21=7, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND TRUE (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 1)))) && (a15==8)) [L502] a21 = 9 [L504] return 21; VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] output = calculate_output(input) [L890] COND TRUE 1 [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=0, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND TRUE (((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1)) [L287] a21 = 10 [L289] return 24; VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] output = calculate_output(input) [L890] COND TRUE 1 [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L321] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L369] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L376] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L406] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L412] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a15==9) && ((((a21==9) || (a21==10)) && (input == 4)) && ((-43 < a12) && (11 >= a12)) )) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 2))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L477] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (((a21==9) || (a21==10)) && (input == 3))) && (a15==9)) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L482] COND FALSE !((((a15==8) && ( 80 < a12 && (((a21==8) || (a21==9)) && (input == 6)))) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L488] COND FALSE !((((((( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))) || ((a21==7) && ((-43 < a12) && (11 >= a12)) )) && (input == 3)) && (a24==1)) && (a15==9))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L494] COND FALSE !(((a24==1) && ((input == 1) && (((a21==10) && ((a15==8) && 80 < a12 )) || (( a12 <= -43 && (a15==9)) && (a21==6)))))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 1)))) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L505] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==7) || (a21==8)) || (a21==9)) && (input == 3)))) && (a15==9))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L510] COND FALSE !((((a24==1) && ((input == 4) && ((((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) )) || ((a21==6) && 80 < a12 )))) && (a15==9))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L516] COND FALSE !(((a15==8) && (((a21==7) && ((input == 2) && (a24==1))) && a12 <= -43 ))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L522] COND FALSE !(((a15==8) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ((a21==6) && ((11 < a12) && (80 >= a12)) ))) && (a24==1)))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L528] COND FALSE !(((a15==9) && (( a12 <= -43 && (((a21==9) || ((a21==7) || (a21==8))) && (input == 2))) && (a24==1)))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L534] COND FALSE !(((a24==1) && ((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 3))))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L540] COND FALSE !((((a15==8) && (((a24==1) && (input == 4)) && ((11 < a12) && (80 >= a12)) )) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L546] COND FALSE !(((((input == 6) && ((( ((11 < a12) && (80 >= a12)) && (a21==9)) || ( ((11 < a12) && (80 >= a12)) && (a21==10))) || ( 80 < a12 && (a21==6)))) && (a24==1)) && (a15==9))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L551] COND FALSE !((((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 6))) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L557] COND FALSE !(((((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 2))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L562] COND FALSE !((((a21==9) && (((input == 3) && (a24==1)) && 80 < a12 )) && (a15==9))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L565] COND FALSE !(((((((a21==7) || (a21==8)) && (input == 1)) && (a15==9)) && 80 < a12 ) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L571] COND FALSE !((((((a15==9) && ( 80 < a12 && (a24==1))) && (a21==10)) || ((a21==6) && (((a24==2) && a12 <= -43 ) && (a15==5)))) && (input == 6))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L578] COND FALSE !(((a15==9) && ((a21==9) && ( 80 < a12 && ((input == 2) && (a24==1)))))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L583] COND FALSE !(((((a15==8) && (((a21==7) || (a21==8)) && (input == 3))) && (a24==1)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L589] COND FALSE !(((a24==1) && ((input == 5) && ((((a15==8) && 80 < a12 ) && (a21==10)) || ((a21==6) && ( a12 <= -43 && (a15==9))))))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L595] COND FALSE !(((a24==1) && (((( 80 < a12 && (a21==6)) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) ))) && (input == 1)) && (a15==9)))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L601] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==8) || (a21==9)) || (a21==10)) && (input == 1)))) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L607] COND FALSE !(((a24==1) && (((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ((a21==6) && ((-43 < a12) && (11 >= a12)) ))) && (input == 6)) && (a15==9)))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L613] COND FALSE !(((a15==8) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 2))) && ((-43 < a12) && (11 >= a12)) ))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L619] COND FALSE !((((((input == 6) && (((a21==6) || (a21==7)) || (a21==8))) && (a15==8)) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L625] COND FALSE !(((a24==1) && (((((a21==7) || (a21==8)) && (input == 6)) && (a15==8)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L631] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 2)) && (a15==9)) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L636] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && (((input == 1) && (a15==8)) && (a24==1))) && (a21==9))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L642] COND FALSE !(((a24==1) && ((a15==9) && ((input == 2) && (( 80 < a12 && (a21==6)) || (( ((11 < a12) && (80 >= a12)) && (a21==9)) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))))))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L648] COND FALSE !(((a24==1) && ((a15==8) && (((input == 2) && ((a21==7) || (a21==8))) && ((11 < a12) && (80 >= a12)) )))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L654] COND FALSE !(((a24==1) && ((a21==9) && (((input == 5) && (a15==9)) && 80 < a12 )))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L660] COND FALSE !((( a12 <= -43 && (((input == 1) && (a21==7)) && (a24==1))) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L666] COND FALSE !((((a21==9) && (( ((11 < a12) && (80 >= a12)) && (input == 3)) && (a24==1))) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L672] COND FALSE !((((a15==8) && ((((a21==8) || (a21==9)) && (input == 2)) && (a24==1))) && 80 < a12 )) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L678] COND FALSE !((( 80 < a12 && ((a24==1) && (((a21==8) || (a21==9)) && (input == 4)))) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L684] COND FALSE !(((a21==9) && ((a15==9) && ((a24==1) && ( 80 < a12 && (input == 1)))))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L687] COND FALSE !(((a15==8) && (((input == 3) && ((((a21==10) && ((11 < a12) && (80 >= a12)) ) || ((a21==6) && 80 < a12 )) || ( 80 < a12 && (a21==7)))) && (a24==1)))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L693] COND FALSE !(((a24==1) && ( 80 < a12 && ((a21==9) && ((a15==9) && (input == 4)))))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L698] COND FALSE !(((a15==8) && (((input == 6) && (( 80 < a12 && (a21==7)) || (((a21==10) && ((11 < a12) && (80 >= a12)) ) || ( 80 < a12 && (a21==6))))) && (a24==1)))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L704] COND FALSE !(((a15==9) && ((a24==1) && ( ((-43 < a12) && (11 >= a12)) && ((input == 1) && ((a21==9) || (a21==10))))))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L710] COND FALSE !(((((( 80 < a12 && (a15==8)) && (a21==10)) || ((a21==6) && ((a15==9) && a12 <= -43 ))) && (input == 6)) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L716] COND FALSE !(((((a15==8) && (((a21==8) || (a21==9)) && (input == 1))) && (a24==1)) && 80 < a12 )) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !((((a24==1) && ((((a21==7) && 80 < a12 ) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ((a21==6) && 80 < a12 ))) && (input == 2))) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L728] COND FALSE !(((a24==1) && ( ((-43 < a12) && (11 >= a12)) && (((((a21==6) || (a21==7)) || (a21==8)) && (input == 4)) && (a15==8))))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L734] COND FALSE !((((a15==8) && (((a21==7) && (input == 4)) && (a24==1))) && a12 <= -43 )) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L740] COND FALSE !(((a21==9) && (((a24==1) && ((input == 2) && ((-43 < a12) && (11 >= a12)) )) && (a15==8)))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L745] COND FALSE !(((a15==8) && (( ((-43 < a12) && (11 >= a12)) && ((a21==9) && (input == 4))) && (a24==1)))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L751] COND FALSE !((( a12 <= -43 && ((((a21==10) || ((a21==8) || (a21==9))) && (input == 4)) && (a15==8))) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L757] COND FALSE !(((a24==1) && ((a15==8) && ((input == 4) && (( 80 < a12 && (a21==7)) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ( 80 < a12 && (a21==6)))))))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L762] COND FALSE !(( ((11 < a12) && (80 >= a12)) && ((a15==8) && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L768] COND FALSE !(((((((a15==8) && 80 < a12 ) && (a21==10)) || ((a21==6) && ( a12 <= -43 && (a15==9)))) && (input == 4)) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L774] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 1))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L781] COND FALSE !((((a15==8) && (((( ((11 < a12) && (80 >= a12)) && (a21==10)) || ( 80 < a12 && (a21==6))) || ( 80 < a12 && (a21==7))) && (input == 5))) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L787] COND FALSE !(((a21==9) && ((((input == 6) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a24==1)))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L793] COND FALSE !(((a24==1) && ((a21==9) && ( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (input == 3)))))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L799] COND FALSE !(((a15==9) && (((input == 3) && (((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) )))) && (a24==1)))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L805] COND FALSE !(( a12 <= -43 && ((a21==7) && ((a24==1) && ((a15==8) && (input == 6)))))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L811] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((((input == 3) && (a24==1)) && (a21==8)) && (a15==9)))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L817] COND FALSE !((((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((((a24==2) && a12 <= -43 ) && (a15==5)) && (a21==6))) && (input == 5))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L824] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && (((a21==7) || (a21==8)) && (input == 5)))) && (a15==8))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L829] COND FALSE !(((((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 1)) && (a15==8)) && (a24==1))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L835] COND FALSE !(((a24==1) && ( ((11 < a12) && (80 >= a12)) && (((((a21==6) || (a21==7)) || (a21==8)) && (input == 6)) && (a15==9))))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L841] COND FALSE !(((a24==1) && (((((a21==7) && 80 < a12 ) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ( 80 < a12 && (a21==6)))) && (input == 1)) && (a15==8)))) VAL [a12=0, a15=8, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L847] COND TRUE (((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 5))) && (a24==1)) [L848] a12 = (((((a12 - -338613) - -126296) * 1) % 34)- -42) [L849] a21 = 9 [L851] return 25; VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] output = calculate_output(input) [L890] COND TRUE 1 [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=69, a15=8, a21=9, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND TRUE (((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) [L258] a12 = (((a12 - -334333) + 32000) / 5) [L259] a21 = 8 [L261] return 22; VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] output = calculate_output(input) [L890] COND TRUE 1 [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L321] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L369] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L376] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L406] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L412] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a15==9) && ((((a21==9) || (a21==10)) && (input == 4)) && ((-43 < a12) && (11 >= a12)) )) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 2))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L477] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (((a21==9) || (a21==10)) && (input == 3))) && (a15==9)) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L482] COND FALSE !((((a15==8) && ( 80 < a12 && (((a21==8) || (a21==9)) && (input == 6)))) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L488] COND FALSE !((((((( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))) || ((a21==7) && ((-43 < a12) && (11 >= a12)) )) && (input == 3)) && (a24==1)) && (a15==9))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L494] COND FALSE !(((a24==1) && ((input == 1) && (((a21==10) && ((a15==8) && 80 < a12 )) || (( a12 <= -43 && (a15==9)) && (a21==6)))))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 1)))) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L505] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==7) || (a21==8)) || (a21==9)) && (input == 3)))) && (a15==9))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L510] COND FALSE !((((a24==1) && ((input == 4) && ((((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) )) || ((a21==6) && 80 < a12 )))) && (a15==9))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L516] COND FALSE !(((a15==8) && (((a21==7) && ((input == 2) && (a24==1))) && a12 <= -43 ))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L522] COND FALSE !(((a15==8) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ((a21==6) && ((11 < a12) && (80 >= a12)) ))) && (a24==1)))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L528] COND FALSE !(((a15==9) && (( a12 <= -43 && (((a21==9) || ((a21==7) || (a21==8))) && (input == 2))) && (a24==1)))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L534] COND FALSE !(((a24==1) && ((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 3))))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L540] COND FALSE !((((a15==8) && (((a24==1) && (input == 4)) && ((11 < a12) && (80 >= a12)) )) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L546] COND FALSE !(((((input == 6) && ((( ((11 < a12) && (80 >= a12)) && (a21==9)) || ( ((11 < a12) && (80 >= a12)) && (a21==10))) || ( 80 < a12 && (a21==6)))) && (a24==1)) && (a15==9))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L551] COND FALSE !((((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 6))) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L557] COND FALSE !(((((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 2))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L562] COND FALSE !((((a21==9) && (((input == 3) && (a24==1)) && 80 < a12 )) && (a15==9))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L565] COND FALSE !(((((((a21==7) || (a21==8)) && (input == 1)) && (a15==9)) && 80 < a12 ) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L571] COND FALSE !((((((a15==9) && ( 80 < a12 && (a24==1))) && (a21==10)) || ((a21==6) && (((a24==2) && a12 <= -43 ) && (a15==5)))) && (input == 6))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L578] COND FALSE !(((a15==9) && ((a21==9) && ( 80 < a12 && ((input == 2) && (a24==1)))))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L583] COND FALSE !(((((a15==8) && (((a21==7) || (a21==8)) && (input == 3))) && (a24==1)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L589] COND FALSE !(((a24==1) && ((input == 5) && ((((a15==8) && 80 < a12 ) && (a21==10)) || ((a21==6) && ( a12 <= -43 && (a15==9))))))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L595] COND FALSE !(((a24==1) && (((( 80 < a12 && (a21==6)) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) ))) && (input == 1)) && (a15==9)))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L601] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==8) || (a21==9)) || (a21==10)) && (input == 1)))) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L607] COND FALSE !(((a24==1) && (((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ((a21==6) && ((-43 < a12) && (11 >= a12)) ))) && (input == 6)) && (a15==9)))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L613] COND FALSE !(((a15==8) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 2))) && ((-43 < a12) && (11 >= a12)) ))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L619] COND FALSE !((((((input == 6) && (((a21==6) || (a21==7)) || (a21==8))) && (a15==8)) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L625] COND FALSE !(((a24==1) && (((((a21==7) || (a21==8)) && (input == 6)) && (a15==8)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L631] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 2)) && (a15==9)) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L636] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && (((input == 1) && (a15==8)) && (a24==1))) && (a21==9))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L642] COND FALSE !(((a24==1) && ((a15==9) && ((input == 2) && (( 80 < a12 && (a21==6)) || (( ((11 < a12) && (80 >= a12)) && (a21==9)) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))))))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L648] COND FALSE !(((a24==1) && ((a15==8) && (((input == 2) && ((a21==7) || (a21==8))) && ((11 < a12) && (80 >= a12)) )))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L654] COND FALSE !(((a24==1) && ((a21==9) && (((input == 5) && (a15==9)) && 80 < a12 )))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L660] COND FALSE !((( a12 <= -43 && (((input == 1) && (a21==7)) && (a24==1))) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L666] COND FALSE !((((a21==9) && (( ((11 < a12) && (80 >= a12)) && (input == 3)) && (a24==1))) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L672] COND FALSE !((((a15==8) && ((((a21==8) || (a21==9)) && (input == 2)) && (a24==1))) && 80 < a12 )) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L678] COND FALSE !((( 80 < a12 && ((a24==1) && (((a21==8) || (a21==9)) && (input == 4)))) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L684] COND FALSE !(((a21==9) && ((a15==9) && ((a24==1) && ( 80 < a12 && (input == 1)))))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L687] COND FALSE !(((a15==8) && (((input == 3) && ((((a21==10) && ((11 < a12) && (80 >= a12)) ) || ((a21==6) && 80 < a12 )) || ( 80 < a12 && (a21==7)))) && (a24==1)))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L693] COND FALSE !(((a24==1) && ( 80 < a12 && ((a21==9) && ((a15==9) && (input == 4)))))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L698] COND FALSE !(((a15==8) && (((input == 6) && (( 80 < a12 && (a21==7)) || (((a21==10) && ((11 < a12) && (80 >= a12)) ) || ( 80 < a12 && (a21==6))))) && (a24==1)))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L704] COND FALSE !(((a15==9) && ((a24==1) && ( ((-43 < a12) && (11 >= a12)) && ((input == 1) && ((a21==9) || (a21==10))))))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L710] COND FALSE !(((((( 80 < a12 && (a15==8)) && (a21==10)) || ((a21==6) && ((a15==9) && a12 <= -43 ))) && (input == 6)) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L716] COND FALSE !(((((a15==8) && (((a21==8) || (a21==9)) && (input == 1))) && (a24==1)) && 80 < a12 )) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !((((a24==1) && ((((a21==7) && 80 < a12 ) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ((a21==6) && 80 < a12 ))) && (input == 2))) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L728] COND FALSE !(((a24==1) && ( ((-43 < a12) && (11 >= a12)) && (((((a21==6) || (a21==7)) || (a21==8)) && (input == 4)) && (a15==8))))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L734] COND FALSE !((((a15==8) && (((a21==7) && (input == 4)) && (a24==1))) && a12 <= -43 )) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L740] COND FALSE !(((a21==9) && (((a24==1) && ((input == 2) && ((-43 < a12) && (11 >= a12)) )) && (a15==8)))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L745] COND FALSE !(((a15==8) && (( ((-43 < a12) && (11 >= a12)) && ((a21==9) && (input == 4))) && (a24==1)))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L751] COND FALSE !((( a12 <= -43 && ((((a21==10) || ((a21==8) || (a21==9))) && (input == 4)) && (a15==8))) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L757] COND FALSE !(((a24==1) && ((a15==8) && ((input == 4) && (( 80 < a12 && (a21==7)) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ( 80 < a12 && (a21==6)))))))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L762] COND FALSE !(( ((11 < a12) && (80 >= a12)) && ((a15==8) && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L768] COND FALSE !(((((((a15==8) && 80 < a12 ) && (a21==10)) || ((a21==6) && ( a12 <= -43 && (a15==9)))) && (input == 4)) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L774] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 1))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L781] COND FALSE !((((a15==8) && (((( ((11 < a12) && (80 >= a12)) && (a21==10)) || ( 80 < a12 && (a21==6))) || ( 80 < a12 && (a21==7))) && (input == 5))) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L787] COND FALSE !(((a21==9) && ((((input == 6) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a24==1)))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L793] COND FALSE !(((a24==1) && ((a21==9) && ( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (input == 3)))))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L799] COND FALSE !(((a15==9) && (((input == 3) && (((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) )))) && (a24==1)))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L805] COND FALSE !(( a12 <= -43 && ((a21==7) && ((a24==1) && ((a15==8) && (input == 6)))))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L811] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((((input == 3) && (a24==1)) && (a21==8)) && (a15==9)))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L817] COND FALSE !((((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((((a24==2) && a12 <= -43 ) && (a15==5)) && (a21==6))) && (input == 5))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L824] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && (((a21==7) || (a21==8)) && (input == 5)))) && (a15==8))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L829] COND FALSE !(((((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 1)) && (a15==8)) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L835] COND FALSE !(((a24==1) && ( ((11 < a12) && (80 >= a12)) && (((((a21==6) || (a21==7)) || (a21==8)) && (input == 6)) && (a15==9))))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L841] COND FALSE !(((a24==1) && (((((a21==7) && 80 < a12 ) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ( 80 < a12 && (a21==6)))) && (input == 1)) && (a15==8)))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L847] COND FALSE !((((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 5))) && (a24==1))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L852] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && (((input == 6) && ((a21==9) || (a21==10))) && (a24==1))) && (a15==9))) VAL [a12=73280, a15=8, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L858] COND TRUE ((a15==8) && ( 80 < a12 && ((a24==1) && (((a21==8) || (a21==9)) && (input == 5))))) [L859] a12 = (((a12 + -600079) - -316691) - 316661) [L860] a15 = 9 [L861] a21 = 8 [L863] return 26; VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] output = calculate_output(input) [L890] COND TRUE 1 [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L321] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L369] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L376] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L406] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L412] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a15==9) && ((((a21==9) || (a21==10)) && (input == 4)) && ((-43 < a12) && (11 >= a12)) )) && (a24==1))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 2))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L477] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (((a21==9) || (a21==10)) && (input == 3))) && (a15==9)) && (a24==1))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L482] COND FALSE !((((a15==8) && ( 80 < a12 && (((a21==8) || (a21==9)) && (input == 6)))) && (a24==1))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L488] COND FALSE !((((((( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))) || ((a21==7) && ((-43 < a12) && (11 >= a12)) )) && (input == 3)) && (a24==1)) && (a15==9))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L494] COND FALSE !(((a24==1) && ((input == 1) && (((a21==10) && ((a15==8) && 80 < a12 )) || (( a12 <= -43 && (a15==9)) && (a21==6)))))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 1)))) && (a15==8))) VAL [a12=4294440527, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L505] COND TRUE (((a24==1) && ( a12 <= -43 && ((((a21==7) || (a21==8)) || (a21==9)) && (input == 3)))) && (a15==9)) [L507] a21 = 10 [L509] return 22; VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] output = calculate_output(input) [L890] COND TRUE 1 [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L321] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L369] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L376] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L406] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L412] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a15==9) && ((((a21==9) || (a21==10)) && (input == 4)) && ((-43 < a12) && (11 >= a12)) )) && (a24==1))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 2))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L477] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (((a21==9) || (a21==10)) && (input == 3))) && (a15==9)) && (a24==1))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L482] COND FALSE !((((a15==8) && ( 80 < a12 && (((a21==8) || (a21==9)) && (input == 6)))) && (a24==1))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L488] COND FALSE !((((((( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))) || ((a21==7) && ((-43 < a12) && (11 >= a12)) )) && (input == 3)) && (a24==1)) && (a15==9))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L494] COND FALSE !(((a24==1) && ((input == 1) && (((a21==10) && ((a15==8) && 80 < a12 )) || (( a12 <= -43 && (a15==9)) && (a21==6)))))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 1)))) && (a15==8))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L505] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==7) || (a21==8)) || (a21==9)) && (input == 3)))) && (a15==9))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L510] COND FALSE !((((a24==1) && ((input == 4) && ((((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) )) || ((a21==6) && 80 < a12 )))) && (a15==9))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L516] COND FALSE !(((a15==8) && (((a21==7) && ((input == 2) && (a24==1))) && a12 <= -43 ))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L522] COND FALSE !(((a15==8) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ((a21==6) && ((11 < a12) && (80 >= a12)) ))) && (a24==1)))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L528] COND FALSE !(((a15==9) && (( a12 <= -43 && (((a21==9) || ((a21==7) || (a21==8))) && (input == 2))) && (a24==1)))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L534] COND FALSE !(((a24==1) && ((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 3))))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L540] COND FALSE !((((a15==8) && (((a24==1) && (input == 4)) && ((11 < a12) && (80 >= a12)) )) && (a21==9))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L546] COND FALSE !(((((input == 6) && ((( ((11 < a12) && (80 >= a12)) && (a21==9)) || ( ((11 < a12) && (80 >= a12)) && (a21==10))) || ( 80 < a12 && (a21==6)))) && (a24==1)) && (a15==9))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L551] COND FALSE !((((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 6))) && (a24==1))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L557] COND FALSE !(((((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 2))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L562] COND FALSE !((((a21==9) && (((input == 3) && (a24==1)) && 80 < a12 )) && (a15==9))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L565] COND FALSE !(((((((a21==7) || (a21==8)) && (input == 1)) && (a15==9)) && 80 < a12 ) && (a24==1))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L571] COND FALSE !((((((a15==9) && ( 80 < a12 && (a24==1))) && (a21==10)) || ((a21==6) && (((a24==2) && a12 <= -43 ) && (a15==5)))) && (input == 6))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L578] COND FALSE !(((a15==9) && ((a21==9) && ( 80 < a12 && ((input == 2) && (a24==1)))))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L583] COND FALSE !(((((a15==8) && (((a21==7) || (a21==8)) && (input == 3))) && (a24==1)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L589] COND FALSE !(((a24==1) && ((input == 5) && ((((a15==8) && 80 < a12 ) && (a21==10)) || ((a21==6) && ( a12 <= -43 && (a15==9))))))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L595] COND FALSE !(((a24==1) && (((( 80 < a12 && (a21==6)) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) ))) && (input == 1)) && (a15==9)))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L601] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==8) || (a21==9)) || (a21==10)) && (input == 1)))) && (a15==8))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L607] COND FALSE !(((a24==1) && (((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ((a21==6) && ((-43 < a12) && (11 >= a12)) ))) && (input == 6)) && (a15==9)))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L613] COND FALSE !(((a15==8) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 2))) && ((-43 < a12) && (11 >= a12)) ))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L619] COND FALSE !((((((input == 6) && (((a21==6) || (a21==7)) || (a21==8))) && (a15==8)) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L625] COND FALSE !(((a24==1) && (((((a21==7) || (a21==8)) && (input == 6)) && (a15==8)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=4294440527, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L631] COND TRUE ((((( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 2)) && (a15==9)) && (a24==1)) [L632] a12 = (((((a12 % 26)- 16) + 343661) - 46416) - 297244) [L633] a21 = 8 [L635] return 25; VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] output = calculate_output(input) [L890] COND TRUE 1 [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L321] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L369] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L376] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L406] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L412] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a15==9) && ((((a21==9) || (a21==10)) && (input == 4)) && ((-43 < a12) && (11 >= a12)) )) && (a24==1))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 2))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L477] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (((a21==9) || (a21==10)) && (input == 3))) && (a15==9)) && (a24==1))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L482] COND FALSE !((((a15==8) && ( 80 < a12 && (((a21==8) || (a21==9)) && (input == 6)))) && (a24==1))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L488] COND FALSE !((((((( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))) || ((a21==7) && ((-43 < a12) && (11 >= a12)) )) && (input == 3)) && (a24==1)) && (a15==9))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L494] COND FALSE !(((a24==1) && ((input == 1) && (((a21==10) && ((a15==8) && 80 < a12 )) || (( a12 <= -43 && (a15==9)) && (a21==6)))))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L500] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 1)))) && (a15==8))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L505] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==7) || (a21==8)) || (a21==9)) && (input == 3)))) && (a15==9))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L510] COND FALSE !((((a24==1) && ((input == 4) && ((((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) )) || ((a21==6) && 80 < a12 )))) && (a15==9))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L516] COND FALSE !(((a15==8) && (((a21==7) && ((input == 2) && (a24==1))) && a12 <= -43 ))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L522] COND FALSE !(((a15==8) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ((a21==6) && ((11 < a12) && (80 >= a12)) ))) && (a24==1)))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L528] COND FALSE !(((a15==9) && (( a12 <= -43 && (((a21==9) || ((a21==7) || (a21==8))) && (input == 2))) && (a24==1)))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L534] COND FALSE !(((a24==1) && ((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 3))))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L540] COND FALSE !((((a15==8) && (((a24==1) && (input == 4)) && ((11 < a12) && (80 >= a12)) )) && (a21==9))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L546] COND FALSE !(((((input == 6) && ((( ((11 < a12) && (80 >= a12)) && (a21==9)) || ( ((11 < a12) && (80 >= a12)) && (a21==10))) || ( 80 < a12 && (a21==6)))) && (a24==1)) && (a15==9))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L551] COND FALSE !((((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 6))) && (a24==1))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L557] COND FALSE !(((((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 2))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L562] COND FALSE !((((a21==9) && (((input == 3) && (a24==1)) && 80 < a12 )) && (a15==9))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L565] COND FALSE !(((((((a21==7) || (a21==8)) && (input == 1)) && (a15==9)) && 80 < a12 ) && (a24==1))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L571] COND FALSE !((((((a15==9) && ( 80 < a12 && (a24==1))) && (a21==10)) || ((a21==6) && (((a24==2) && a12 <= -43 ) && (a15==5)))) && (input == 6))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L578] COND FALSE !(((a15==9) && ((a21==9) && ( 80 < a12 && ((input == 2) && (a24==1)))))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L583] COND FALSE !(((((a15==8) && (((a21==7) || (a21==8)) && (input == 3))) && (a24==1)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L589] COND FALSE !(((a24==1) && ((input == 5) && ((((a15==8) && 80 < a12 ) && (a21==10)) || ((a21==6) && ( a12 <= -43 && (a15==9))))))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L595] COND FALSE !(((a24==1) && (((( 80 < a12 && (a21==6)) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) ))) && (input == 1)) && (a15==9)))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L601] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==8) || (a21==9)) || (a21==10)) && (input == 1)))) && (a15==8))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L607] COND FALSE !(((a24==1) && (((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ((a21==6) && ((-43 < a12) && (11 >= a12)) ))) && (input == 6)) && (a15==9)))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L613] COND FALSE !(((a15==8) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 2))) && ((-43 < a12) && (11 >= a12)) ))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L619] COND FALSE !((((((input == 6) && (((a21==6) || (a21==7)) || (a21==8))) && (a15==8)) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L625] COND FALSE !(((a24==1) && (((((a21==7) || (a21==8)) && (input == 6)) && (a15==8)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L631] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 2)) && (a15==9)) && (a24==1))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L636] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && (((input == 1) && (a15==8)) && (a24==1))) && (a21==9))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L642] COND FALSE !(((a24==1) && ((a15==9) && ((input == 2) && (( 80 < a12 && (a21==6)) || (( ((11 < a12) && (80 >= a12)) && (a21==9)) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))))))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L648] COND FALSE !(((a24==1) && ((a15==8) && (((input == 2) && ((a21==7) || (a21==8))) && ((11 < a12) && (80 >= a12)) )))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L654] COND FALSE !(((a24==1) && ((a21==9) && (((input == 5) && (a15==9)) && 80 < a12 )))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L660] COND FALSE !((( a12 <= -43 && (((input == 1) && (a21==7)) && (a24==1))) && (a15==8))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L666] COND FALSE !((((a21==9) && (( ((11 < a12) && (80 >= a12)) && (input == 3)) && (a24==1))) && (a15==8))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L672] COND FALSE !((((a15==8) && ((((a21==8) || (a21==9)) && (input == 2)) && (a24==1))) && 80 < a12 )) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L678] COND FALSE !((( 80 < a12 && ((a24==1) && (((a21==8) || (a21==9)) && (input == 4)))) && (a15==8))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L684] COND FALSE !(((a21==9) && ((a15==9) && ((a24==1) && ( 80 < a12 && (input == 1)))))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L687] COND FALSE !(((a15==8) && (((input == 3) && ((((a21==10) && ((11 < a12) && (80 >= a12)) ) || ((a21==6) && 80 < a12 )) || ( 80 < a12 && (a21==7)))) && (a24==1)))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L693] COND FALSE !(((a24==1) && ( 80 < a12 && ((a21==9) && ((a15==9) && (input == 4)))))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L698] COND FALSE !(((a15==8) && (((input == 6) && (( 80 < a12 && (a21==7)) || (((a21==10) && ((11 < a12) && (80 >= a12)) ) || ( 80 < a12 && (a21==6))))) && (a24==1)))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L704] COND FALSE !(((a15==9) && ((a24==1) && ( ((-43 < a12) && (11 >= a12)) && ((input == 1) && ((a21==9) || (a21==10))))))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L710] COND FALSE !(((((( 80 < a12 && (a15==8)) && (a21==10)) || ((a21==6) && ((a15==9) && a12 <= -43 ))) && (input == 6)) && (a24==1))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L716] COND FALSE !(((((a15==8) && (((a21==8) || (a21==9)) && (input == 1))) && (a24==1)) && 80 < a12 )) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L722] COND FALSE !((((a24==1) && ((((a21==7) && 80 < a12 ) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ((a21==6) && 80 < a12 ))) && (input == 2))) && (a15==8))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L728] COND FALSE !(((a24==1) && ( ((-43 < a12) && (11 >= a12)) && (((((a21==6) || (a21==7)) || (a21==8)) && (input == 4)) && (a15==8))))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L734] COND FALSE !((((a15==8) && (((a21==7) && (input == 4)) && (a24==1))) && a12 <= -43 )) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L740] COND FALSE !(((a21==9) && (((a24==1) && ((input == 2) && ((-43 < a12) && (11 >= a12)) )) && (a15==8)))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L745] COND FALSE !(((a15==8) && (( ((-43 < a12) && (11 >= a12)) && ((a21==9) && (input == 4))) && (a24==1)))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L751] COND FALSE !((( a12 <= -43 && ((((a21==10) || ((a21==8) || (a21==9))) && (input == 4)) && (a15==8))) && (a24==1))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L757] COND FALSE !(((a24==1) && ((a15==8) && ((input == 4) && (( 80 < a12 && (a21==7)) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ( 80 < a12 && (a21==6)))))))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L762] COND FALSE !(( ((11 < a12) && (80 >= a12)) && ((a15==8) && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L768] COND FALSE !(((((((a15==8) && 80 < a12 ) && (a21==10)) || ((a21==6) && ( a12 <= -43 && (a15==9)))) && (input == 4)) && (a24==1))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L774] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 1))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L781] COND FALSE !((((a15==8) && (((( ((11 < a12) && (80 >= a12)) && (a21==10)) || ( 80 < a12 && (a21==6))) || ( 80 < a12 && (a21==7))) && (input == 5))) && (a24==1))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L787] COND FALSE !(((a21==9) && ((((input == 6) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a24==1)))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L793] COND FALSE !(((a24==1) && ((a21==9) && ( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (input == 3)))))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L799] COND FALSE !(((a15==9) && (((input == 3) && (((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) )))) && (a24==1)))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L805] COND FALSE !(( a12 <= -43 && ((a21==7) && ((a24==1) && ((a15==8) && (input == 6)))))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L811] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((((input == 3) && (a24==1)) && (a21==8)) && (a15==9)))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L817] COND FALSE !((((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((((a24==2) && a12 <= -43 ) && (a15==5)) && (a21==6))) && (input == 5))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L824] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && (((a21==7) || (a21==8)) && (input == 5)))) && (a15==8))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L829] COND FALSE !(((((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 1)) && (a15==8)) && (a24==1))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L835] COND FALSE !(((a24==1) && ( ((11 < a12) && (80 >= a12)) && (((((a21==6) || (a21==7)) || (a21==8)) && (input == 6)) && (a15==9))))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L841] COND FALSE !(((a24==1) && (((((a21==7) && 80 < a12 ) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ( 80 < a12 && (a21==6)))) && (input == 1)) && (a15==8)))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L847] COND FALSE !((((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 5))) && (a24==1))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L852] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && (((input == 6) && ((a21==9) || (a21==10))) && (a24==1))) && (a15==9))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L858] COND FALSE !(((a15==8) && ( 80 < a12 && ((a24==1) && (((a21==8) || (a21==9)) && (input == 5)))))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L864] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 5)))) && 80 < a12 )) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L869] COND FALSE !((((((input == 5) && ((-43 < a12) && (11 >= a12)) ) && (a21==8)) && (a24==1)) && (a15==9))) VAL [a12=4294967272, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L875] COND TRUE ((a15==9) && ((((input == 4) && (a24==1)) && (a21==8)) && ((-43 < a12) && (11 >= a12)) )) [L877] a21 = 10 [L879] return 22; VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] output = calculate_output(input) [L890] COND TRUE 1 [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L321] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L369] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L376] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L382] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L394] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L400] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L406] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L412] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L430] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L436] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L442] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L448] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L454] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L459] COND FALSE !((((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a15==9) && ((((a21==9) || (a21==10)) && (input == 4)) && ((-43 < a12) && (11 >= a12)) )) && (a24==1))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 2))) VAL [a12=4294967272, a15=9, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L477] COND TRUE ((( ((-43 < a12) && (11 >= a12)) && (((a21==9) || (a21==10)) && (input == 3))) && (a15==9)) && (a24==1)) [L478] a12 = (((a12 + 66) - 3) + -2) [L479] a21 = 8 [L481] return 21; VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] output = calculate_output(input) [L890] COND TRUE 1 [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L221] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L239] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L245] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L262] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L268] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L274] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L279] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L285] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L290] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L303] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L309] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L315] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L321] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L351] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L357] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) VAL [a12=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L363] COND TRUE ((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) ) [L365] a15 = 6 [L366] a21 = 8 [L368] return -1; VAL [a12=37, a15=6, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L898] output = calculate_output(input) [L890] COND TRUE 1 [L893] int input; [L894] input = __VERIFIER_nondet_int() [L895] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=37, a15=6, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=37, a15=6, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=37, a15=6, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) VAL [a12=37, a15=6, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) VAL [a12=37, a15=6, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) VAL [a12=37, a15=6, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=37, a15=6, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=37, a15=6, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=37, a15=6, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) VAL [a12=37, a15=6, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) VAL [a12=37, a15=6, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) VAL [a12=37, a15=6, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) VAL [a12=37, a15=6, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) VAL [a12=37, a15=6, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) VAL [a12=37, a15=6, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) VAL [a12=37, a15=6, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) VAL [a12=37, a15=6, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND TRUE ((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8)) VAL [a12=37, a15=6, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] reach_error() VAL [a12=37, a15=6, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 616.0s, OverallIterations: 18, TraceHistogramMax: 13, AutomataDifference: 498.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1539 SDtfs, 18034 SDslu, 946 SDs, 0 SdLazy, 50148 SolverSat, 3475 SolverUnsat, 85 SolverUnknown, 0 SolverNotchecked, 438.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36951 GetRequests, 36571 SyntacticMatches, 95 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3627 ImplicationChecksByTransitivity, 62.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9429occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 7525 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 6.0s SatisfiabilityAnalysisTime, 101.7s InterpolantComputationTime, 22588 NumberOfCodeBlocks, 22588 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 36827 ConstructedInterpolants, 0 QuantifiedInterpolants, 249525020 SizeOfPredicates, 108 NumberOfNonLiveVariables, 23834 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 50 InterpolantComputations, 12 PerfectInterpolantSequences, 79255/101447 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! Received shutdown request...