./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_label13.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_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label13.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 d4862063d5473c5aa76cd26fadd3d3a9b63f4761 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label13.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 d4862063d5473c5aa76cd26fadd3d3a9b63f4761 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 07:09:54,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 07:09:54,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 07:09:54,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 07:09:54,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 07:09:54,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 07:09:54,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 07:09:54,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 07:09:54,571 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 07:09:54,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 07:09:54,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 07:09:54,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 07:09:54,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 07:09:54,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 07:09:54,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 07:09:54,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 07:09:54,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 07:09:54,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 07:09:54,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 07:09:54,583 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 07:09:54,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 07:09:54,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 07:09:54,586 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 07:09:54,587 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 07:09:54,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 07:09:54,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 07:09:54,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 07:09:54,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 07:09:54,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 07:09:54,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 07:09:54,592 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 07:09:54,593 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 07:09:54,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 07:09:54,594 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 07:09:54,595 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 07:09:54,595 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 07:09:54,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 07:09:54,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 07:09:54,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 07:09:54,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 07:09:54,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 07:09:54,597 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 07:09:54,613 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 07:09:54,613 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 07:09:54,613 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 07:09:54,614 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 07:09:54,614 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 07:09:54,614 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 07:09:54,614 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 07:09:54,614 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 07:09:54,614 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 07:09:54,614 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 07:09:54,614 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 07:09:54,614 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 07:09:54,615 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 07:09:54,615 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 07:09:54,615 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 07:09:54,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 07:09:54,615 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 07:09:54,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 07:09:54,616 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 07:09:54,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 07:09:54,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 07:09:54,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 07:09:54,616 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 07:09:54,616 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 07:09:54,616 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 07:09:54,616 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 07:09:54,616 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 07:09:54,617 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 07:09:54,617 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 07:09:54,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 07:09:54,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 07:09:54,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 07:09:54,617 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 07:09:54,617 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 07:09:54,617 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 07:09:54,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 07:09:54,618 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 07:09:54,618 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 07:09:54,618 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 07:09:54,618 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_e2123155-6c01-49c6-bebd-b1c796827455/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_e2123155-6c01-49c6-bebd-b1c796827455/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 -> d4862063d5473c5aa76cd26fadd3d3a9b63f4761 [2020-12-09 07:09:54,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 07:09:54,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 07:09:54,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 07:09:54,805 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 07:09:54,806 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 07:09:54,807 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem14_label13.c [2020-12-09 07:09:54,847 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/data/7ab50dbe6/2443f5b16e5949509de58efcf78a58ed/FLAG3ef921743 [2020-12-09 07:09:55,274 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 07:09:55,275 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/sv-benchmarks/c/eca-rers2012/Problem14_label13.c [2020-12-09 07:09:55,285 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/data/7ab50dbe6/2443f5b16e5949509de58efcf78a58ed/FLAG3ef921743 [2020-12-09 07:09:55,295 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/data/7ab50dbe6/2443f5b16e5949509de58efcf78a58ed [2020-12-09 07:09:55,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 07:09:55,297 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 07:09:55,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 07:09:55,299 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 07:09:55,301 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 07:09:55,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:09:55" (1/1) ... [2020-12-09 07:09:55,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b473021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:55, skipping insertion in model container [2020-12-09 07:09:55,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:09:55" (1/1) ... [2020-12-09 07:09:55,308 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 07:09:55,347 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 07:09:55,471 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_e2123155-6c01-49c6-bebd-b1c796827455/sv-benchmarks/c/eca-rers2012/Problem14_label13.c[2689,2702] [2020-12-09 07:09:55,605 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 07:09:55,611 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 07:09:55,623 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_e2123155-6c01-49c6-bebd-b1c796827455/sv-benchmarks/c/eca-rers2012/Problem14_label13.c[2689,2702] [2020-12-09 07:09:55,685 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 07:09:55,696 INFO L208 MainTranslator]: Completed translation [2020-12-09 07:09:55,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:55 WrapperNode [2020-12-09 07:09:55,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 07:09:55,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 07:09:55,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 07:09:55,697 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 07:09:55,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:55" (1/1) ... [2020-12-09 07:09:55,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:55" (1/1) ... [2020-12-09 07:09:55,782 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 07:09:55,783 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 07:09:55,783 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 07:09:55,783 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 07:09:55,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:55" (1/1) ... [2020-12-09 07:09:55,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:55" (1/1) ... [2020-12-09 07:09:55,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:55" (1/1) ... [2020-12-09 07:09:55,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:55" (1/1) ... [2020-12-09 07:09:55,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:55" (1/1) ... [2020-12-09 07:09:55,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:55" (1/1) ... [2020-12-09 07:09:55,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:55" (1/1) ... [2020-12-09 07:09:55,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 07:09:55,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 07:09:55,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 07:09:55,883 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 07:09:55,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 07:09:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 07:09:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 07:09:55,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 07:09:55,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 07:10:06,376 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 07:10:06,376 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-09 07:10:06,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:10:06 BoogieIcfgContainer [2020-12-09 07:10:06,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 07:10:06,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 07:10:06,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 07:10:06,381 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 07:10:06,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:09:55" (1/3) ... [2020-12-09 07:10:06,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6d4af0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:10:06, skipping insertion in model container [2020-12-09 07:10:06,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:55" (2/3) ... [2020-12-09 07:10:06,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6d4af0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:10:06, skipping insertion in model container [2020-12-09 07:10:06,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:10:06" (3/3) ... [2020-12-09 07:10:06,383 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem14_label13.c [2020-12-09 07:10:06,393 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 07:10:06,395 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 07:10:06,402 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 07:10:06,417 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 07:10:06,417 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 07:10:06,417 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 07:10:06,417 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 07:10:06,417 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 07:10:06,418 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 07:10:06,418 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 07:10:06,418 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 07:10:06,425 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-12-09 07:10:06,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 07:10:06,428 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:10:06,429 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 07:10:06,429 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:10:06,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:10:06,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1037743951, now seen corresponding path program 1 times [2020-12-09 07:10:06,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:10:06,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284607728] [2020-12-09 07:10:06,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:10:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:10:06,556 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 07:10:06,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284607728] [2020-12-09 07:10:06,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:10:06,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 07:10:06,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606720060] [2020-12-09 07:10:06,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:10:06,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 07:10:06,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:10:06,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:10:06,571 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-12-09 07:10:06,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:10:06,625 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-12-09 07:10:06,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:10:06,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-09 07:10:06,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:10:06,632 INFO L225 Difference]: With dead ends: 23 [2020-12-09 07:10:06,632 INFO L226 Difference]: Without dead ends: 11 [2020-12-09 07:10:06,634 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 07:10:06,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-12-09 07:10:06,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-12-09 07:10:06,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-12-09 07:10:06,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2020-12-09 07:10:06,654 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 5 [2020-12-09 07:10:06,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:10:06,655 INFO L481 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2020-12-09 07:10:06,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:10:06,655 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-12-09 07:10:06,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 07:10:06,655 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:10:06,655 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2020-12-09 07:10:06,656 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 07:10:06,656 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:10:06,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:10:06,656 INFO L82 PathProgramCache]: Analyzing trace with hash 700077063, now seen corresponding path program 1 times [2020-12-09 07:10:06,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 07:10:06,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262218145] [2020-12-09 07:10:06,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 07:10:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:10:06,947 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 07:10:06,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262218145] [2020-12-09 07:10:06,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277002528] [2020-12-09 07:10:06,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 07:10:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:10:07,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 07:10:07,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:10:07,258 WARN L197 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 1339 DAG size of output: 83 [2020-12-09 07:10:07,324 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 07:10:07,326 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,328 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,329 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 07:10:07,330 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,332 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,333 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 07:10:07,336 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,337 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 07:10:07,341 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,342 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,344 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 07:10:07,346 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,348 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,354 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,355 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 07:10:07,355 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 07:10:07,356 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,358 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,361 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:10:07,363 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 07:10:07,366 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,367 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,367 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 07:10:07,371 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,372 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,376 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,377 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:10:07,379 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 07:10:07,380 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 07:10:07,380 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,381 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,382 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 07:10:07,385 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,387 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,389 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:10:07,391 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 07:10:07,392 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,395 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 07:10:07,398 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 07:10:07,399 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:10:07,400 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 07:10:07,401 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 07:10:07,403 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 07:10:07,407 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:10:07,409 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 07:10:07,410 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 07:10:07,412 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,415 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,416 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,416 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 07:10:07,417 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,418 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,419 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,420 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 07:10:07,421 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,421 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,422 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 07:10:07,425 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,426 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,429 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 07:10:07,430 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:10:07,431 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 07:10:07,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,434 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,438 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:10:07,440 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 07:10:07,441 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 07:10:07,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:10:07,443 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 07:10:07,445 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:10:07,447 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 07:10:07,450 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 07:10:07,451 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,451 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,454 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:10:07,455 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 07:10:07,459 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:10:07,460 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:10:07,460 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 6 disjuncts [2020-12-09 07:10:07,461 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 07:10:07,462 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 07:10:07,462 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,463 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,466 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 07:10:07,467 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 07:10:07,470 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:10:07,470 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 07:10:07,471 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 07:10:07,473 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 07:10:07,476 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 6 disjuncts [2020-12-09 07:10:07,477 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 07:10:07,478 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 07:10:07,479 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 07:10:07,481 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-12-09 07:10:07,484 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 07:10:07,484 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 6 disjuncts [2020-12-09 07:10:07,485 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 6 disjuncts [2020-12-09 07:10:07,488 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-12-09 07:10:07,495 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 14, 4, 11, 4, 11, 4, 8, 4, 5, 4, 2, 4, 1] term [2020-12-09 07:10:07,495 INFO L639 QuantifierPusher]: Distributing 14 conjuncts over 2 disjuncts [2020-12-09 07:10:07,496 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 11, 4, 11, 4, 8, 4, 5, 4, 2, 4, 1] term [2020-12-09 07:10:07,496 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 2 disjuncts [2020-12-09 07:10:07,497 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 11, 4, 8, 4, 5, 4, 2, 4, 1] term [2020-12-09 07:10:07,497 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 2 disjuncts [2020-12-09 07:10:07,498 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 8, 4, 5, 4, 2, 4, 1] term [2020-12-09 07:10:07,498 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 2 disjuncts [2020-12-09 07:10:07,499 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 1] term [2020-12-09 07:10:07,499 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,500 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 2, 4, 1] term [2020-12-09 07:10:07,500 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 07:10:07,501 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 5, 4, 2, 4, 1] term [2020-12-09 07:10:07,501 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 07:10:07,502 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 11, 4, 8, 4, 5, 4, 2, 4, 1] term [2020-12-09 07:10:07,502 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 2 disjuncts [2020-12-09 07:10:07,502 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 8, 4, 5, 4, 2, 4, 1] term [2020-12-09 07:10:07,503 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 2 disjuncts [2020-12-09 07:10:07,504 INFO L639 QuantifierPusher]: Distributing 14 conjuncts over 2 disjuncts [2020-12-09 07:10:07,504 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,507 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 2 disjuncts [2020-12-09 07:10:07,508 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 3 disjuncts [2020-12-09 07:10:07,508 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:10:07,509 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,512 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,514 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,515 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 2 disjuncts [2020-12-09 07:10:07,515 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,517 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,518 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:10:07,519 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,521 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 07:10:07,522 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,523 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,526 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:10:07,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,531 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 07:10:07,531 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,533 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,535 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 07:10:07,536 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:10:07,536 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,538 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 07:10:07,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,540 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,543 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,544 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 3 disjuncts [2020-12-09 07:10:07,545 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:10:07,545 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:10:07,546 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,548 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,549 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 3 disjuncts [2020-12-09 07:10:07,550 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:10:07,550 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,552 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 3 disjuncts [2020-12-09 07:10:07,553 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:10:07,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,555 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,559 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 3 disjuncts [2020-12-09 07:10:07,560 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:10:07,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,562 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 3 disjuncts [2020-12-09 07:10:07,563 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:10:07,563 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,565 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,566 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,568 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:10:07,569 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:10:07,569 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,572 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 2 disjuncts [2020-12-09 07:10:07,573 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 07:10:07,573 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:10:07,574 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,576 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 07:10:07,576 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,578 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,580 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 2 disjuncts [2020-12-09 07:10:07,580 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,582 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 3 disjuncts [2020-12-09 07:10:07,582 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:10:07,583 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,586 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,587 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 2 disjuncts [2020-12-09 07:10:07,588 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,589 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,590 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:10:07,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,593 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 07:10:07,593 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,594 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,597 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:10:07,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,599 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 07:10:07,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,603 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,605 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,606 INFO L639 QuantifierPusher]: Distributing 11 conjuncts over 3 disjuncts [2020-12-09 07:10:07,606 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:10:07,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,609 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 3 disjuncts [2020-12-09 07:10:07,609 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:10:07,610 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,615 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:10:07,616 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:10:07,616 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,619 INFO L639 QuantifierPusher]: Distributing 18 conjuncts over 2 disjuncts [2020-12-09 07:10:07,620 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 3 disjuncts [2020-12-09 07:10:07,621 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,621 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,623 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 07:10:07,624 INFO L639 QuantifierPusher]: Distributing 12 conjuncts over 3 disjuncts [2020-12-09 07:10:07,625 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:10:07,626 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,627 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 3 disjuncts [2020-12-09 07:10:07,627 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,629 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,629 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,631 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,634 INFO L639 QuantifierPusher]: Distributing 14 conjuncts over 2 disjuncts [2020-12-09 07:10:07,635 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 3 disjuncts [2020-12-09 07:10:07,636 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,638 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 07:10:07,639 INFO L639 QuantifierPusher]: Distributing 12 conjuncts over 3 disjuncts [2020-12-09 07:10:07,639 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:10:07,640 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,641 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 3 disjuncts [2020-12-09 07:10:07,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,643 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,644 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,646 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,650 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:10:07,651 INFO L639 QuantifierPusher]: Distributing 12 conjuncts over 2 disjuncts [2020-12-09 07:10:07,651 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:10:07,652 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 07:10:07,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,655 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 3 disjuncts [2020-12-09 07:10:07,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,657 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,657 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,659 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 07:10:07,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,662 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,663 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 2 disjuncts [2020-12-09 07:10:07,664 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,666 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 07:10:07,666 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,668 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,670 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,671 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,672 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,673 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,675 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,675 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,676 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,677 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 07:10:07,678 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:10:07,679 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 07:10:07,681 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:10:07,681 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:10:07,683 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 2 disjuncts [2020-12-09 07:10:07,684 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 07:10:07,684 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,686 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,688 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,688 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,691 INFO L639 QuantifierPusher]: Distributing 14 conjuncts over 3 disjuncts [2020-12-09 07:10:07,691 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 3 disjuncts [2020-12-09 07:10:07,692 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,694 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:10:07,695 INFO L639 QuantifierPusher]: Distributing 12 conjuncts over 3 disjuncts [2020-12-09 07:10:07,696 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:10:07,697 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,698 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 3 disjuncts [2020-12-09 07:10:07,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,700 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,700 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,702 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,702 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,704 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,705 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:10:07,705 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:10:07,707 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 07:10:07,708 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:10:07,709 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:10:07,709 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:10:07,711 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,713 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:10:07,714 INFO L639 QuantifierPusher]: Distributing 12 conjuncts over 2 disjuncts [2020-12-09 07:10:07,714 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:10:07,715 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 07:10:07,716 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,718 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 3 disjuncts [2020-12-09 07:10:07,742 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,744 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,745 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,747 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 07:10:07,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,752 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 2 disjuncts [2020-12-09 07:10:07,752 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,754 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 07:10:07,755 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,757 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,759 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,761 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,762 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,766 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,767 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,769 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,770 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 2 disjuncts [2020-12-09 07:10:07,771 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:10:07,772 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 07:10:07,774 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 07:10:07,775 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:10:07,776 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 07:10:07,779 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:10:07,779 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:10:07,782 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 07:10:07,782 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:10:07,784 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 07:10:07,786 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:10:07,787 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:10:07,789 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 2 disjuncts [2020-12-09 07:10:07,791 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 07:10:07,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,793 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:10:07,796 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,796 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,799 INFO L639 QuantifierPusher]: Distributing 10 conjuncts over 2 disjuncts [2020-12-09 07:10:07,799 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,801 INFO L639 QuantifierPusher]: Distributing 8 conjuncts over 3 disjuncts [2020-12-09 07:10:07,802 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,803 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:10:07,804 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,805 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,806 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,807 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:10:07,807 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,809 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 07:10:07,809 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,810 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:10:07,810 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,812 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:10:07,812 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,814 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,814 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:10:07,815 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,816 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:10:07,817 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,818 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,819 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,820 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:10:07,821 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,822 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,823 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:10:07,824 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:10:07,824 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,825 INFO L639 QuantifierPusher]: Distributing 7 conjuncts over 3 disjuncts [2020-12-09 07:10:07,826 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,827 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:10:07,827 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,829 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:10:07,829 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,831 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,832 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:10:07,832 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:10:07,842 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 07:10:07,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:10:08,169 WARN L197 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 2658 DAG size of output: 2498 [2020-12-09 07:10:08,188 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2020-12-09 07:10:08,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [761853254] [2020-12-09 07:10:08,204 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2020-12-09 07:10:08,204 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 07:10:08,207 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 07:10:08,211 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 07:10:08,212 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 07:10:08,346 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 19 [2020-12-09 07:10:08,802 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 19 [2020-12-09 07:10:09,786 WARN L197 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 2503 DAG size of output: 2362 [2020-12-09 07:10:24,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-12-09 07:10:24,621 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 07:10:24,634 INFO L168 Benchmark]: Toolchain (without parser) took 29334.53 ms. Allocated memory was 113.2 MB in the beginning and 721.4 MB in the end (delta: 608.2 MB). Free memory was 74.2 MB in the beginning and 384.3 MB in the end (delta: -310.1 MB). Peak memory consumption was 509.5 MB. Max. memory is 16.1 GB. [2020-12-09 07:10:24,635 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 113.2 MB. Free memory is still 92.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 07:10:24,635 INFO L168 Benchmark]: CACSL2BoogieTranslator took 397.78 ms. Allocated memory is still 113.2 MB. Free memory was 74.0 MB in the beginning and 68.3 MB in the end (delta: 5.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-09 07:10:24,636 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.53 ms. Allocated memory is still 113.2 MB. Free memory was 68.3 MB in the beginning and 58.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-09 07:10:24,636 INFO L168 Benchmark]: Boogie Preprocessor took 91.24 ms. Allocated memory is still 113.2 MB. Free memory was 58.9 MB in the beginning and 52.5 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-09 07:10:24,637 INFO L168 Benchmark]: RCFGBuilder took 10495.99 ms. Allocated memory was 113.2 MB in the beginning and 331.4 MB in the end (delta: 218.1 MB). Free memory was 84.8 MB in the beginning and 110.5 MB in the end (delta: -25.6 MB). Peak memory consumption was 248.6 MB. Max. memory is 16.1 GB. [2020-12-09 07:10:24,637 INFO L168 Benchmark]: TraceAbstraction took 18252.43 ms. Allocated memory was 331.4 MB in the beginning and 721.4 MB in the end (delta: 390.1 MB). Free memory was 110.5 MB in the beginning and 384.3 MB in the end (delta: -273.8 MB). Peak memory consumption was 327.0 MB. Max. memory is 16.1 GB. [2020-12-09 07:10:24,640 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.12 ms. Allocated memory is still 113.2 MB. Free memory is still 92.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 397.78 ms. Allocated memory is still 113.2 MB. Free memory was 74.0 MB in the beginning and 68.3 MB in the end (delta: 5.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 85.53 ms. Allocated memory is still 113.2 MB. Free memory was 68.3 MB in the beginning and 58.9 MB in the end (delta: 9.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 91.24 ms. Allocated memory is still 113.2 MB. Free memory was 58.9 MB in the beginning and 52.5 MB in the end (delta: 6.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 10495.99 ms. Allocated memory was 113.2 MB in the beginning and 331.4 MB in the end (delta: 218.1 MB). Free memory was 84.8 MB in the beginning and 110.5 MB in the end (delta: -25.6 MB). Peak memory consumption was 248.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 18252.43 ms. Allocated memory was 331.4 MB in the beginning and 721.4 MB in the end (delta: 390.1 MB). Free memory was 110.5 MB in the beginning and 384.3 MB in the end (delta: -273.8 MB). Peak memory consumption was 327.0 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 07:10:26,249 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 07:10:26,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 07:10:26,278 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 07:10:26,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 07:10:26,280 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 07:10:26,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 07:10:26,283 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 07:10:26,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 07:10:26,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 07:10:26,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 07:10:26,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 07:10:26,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 07:10:26,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 07:10:26,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 07:10:26,290 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 07:10:26,291 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 07:10:26,292 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 07:10:26,293 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 07:10:26,295 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 07:10:26,296 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 07:10:26,298 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 07:10:26,299 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 07:10:26,299 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 07:10:26,302 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 07:10:26,302 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 07:10:26,302 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 07:10:26,303 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 07:10:26,303 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 07:10:26,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 07:10:26,305 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 07:10:26,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 07:10:26,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 07:10:26,306 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 07:10:26,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 07:10:26,308 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 07:10:26,308 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 07:10:26,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 07:10:26,309 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 07:10:26,309 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 07:10:26,310 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 07:10:26,310 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2020-12-09 07:10:26,338 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 07:10:26,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 07:10:26,339 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 07:10:26,339 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 07:10:26,339 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 07:10:26,339 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 07:10:26,339 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 07:10:26,339 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 07:10:26,339 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 07:10:26,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 07:10:26,340 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 07:10:26,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 07:10:26,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 07:10:26,341 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 07:10:26,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 07:10:26,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 07:10:26,341 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 07:10:26,341 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 07:10:26,341 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 07:10:26,341 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 07:10:26,342 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 07:10:26,342 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 07:10:26,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 07:10:26,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 07:10:26,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 07:10:26,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 07:10:26,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 07:10:26,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 07:10:26,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 07:10:26,343 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 07:10:26,343 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 07:10:26,343 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 07:10:26,343 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 07:10:26,343 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 07:10:26,344 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 07:10:26,344 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_e2123155-6c01-49c6-bebd-b1c796827455/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_e2123155-6c01-49c6-bebd-b1c796827455/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 -> d4862063d5473c5aa76cd26fadd3d3a9b63f4761 [2020-12-09 07:10:26,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 07:10:26,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 07:10:26,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 07:10:26,586 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 07:10:26,587 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 07:10:26,588 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem14_label13.c [2020-12-09 07:10:26,630 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/data/273480d83/a4a3ced76f5d4fd4bff6d668f09b20b7/FLAGbe5b3c55f [2020-12-09 07:10:27,089 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 07:10:27,089 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/sv-benchmarks/c/eca-rers2012/Problem14_label13.c [2020-12-09 07:10:27,108 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/data/273480d83/a4a3ced76f5d4fd4bff6d668f09b20b7/FLAGbe5b3c55f [2020-12-09 07:10:27,616 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/data/273480d83/a4a3ced76f5d4fd4bff6d668f09b20b7 [2020-12-09 07:10:27,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 07:10:27,619 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 07:10:27,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 07:10:27,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 07:10:27,622 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 07:10:27,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:10:27" (1/1) ... [2020-12-09 07:10:27,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26d2d48e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:27, skipping insertion in model container [2020-12-09 07:10:27,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:10:27" (1/1) ... [2020-12-09 07:10:27,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 07:10:27,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 07:10:27,784 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_e2123155-6c01-49c6-bebd-b1c796827455/sv-benchmarks/c/eca-rers2012/Problem14_label13.c[2689,2702] [2020-12-09 07:10:27,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 07:10:27,975 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 07:10:27,992 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_e2123155-6c01-49c6-bebd-b1c796827455/sv-benchmarks/c/eca-rers2012/Problem14_label13.c[2689,2702] [2020-12-09 07:10:28,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 07:10:28,119 INFO L208 MainTranslator]: Completed translation [2020-12-09 07:10:28,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:28 WrapperNode [2020-12-09 07:10:28,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 07:10:28,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 07:10:28,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 07:10:28,121 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 07:10:28,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:28" (1/1) ... [2020-12-09 07:10:28,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:28" (1/1) ... [2020-12-09 07:10:28,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 07:10:28,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 07:10:28,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 07:10:28,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 07:10:28,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:28" (1/1) ... [2020-12-09 07:10:28,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:28" (1/1) ... [2020-12-09 07:10:28,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:28" (1/1) ... [2020-12-09 07:10:28,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:28" (1/1) ... [2020-12-09 07:10:28,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:28" (1/1) ... [2020-12-09 07:10:28,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:28" (1/1) ... [2020-12-09 07:10:28,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:28" (1/1) ... [2020-12-09 07:10:28,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 07:10:28,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 07:10:28,240 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 07:10:28,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 07:10:28,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 07:10:28,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-09 07:10:28,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 07:10:28,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 07:10:28,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 07:10:30,738 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 07:10:30,739 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-09 07:10:30,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:10:30 BoogieIcfgContainer [2020-12-09 07:10:30,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 07:10:30,742 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 07:10:30,742 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 07:10:30,745 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 07:10:30,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:10:27" (1/3) ... [2020-12-09 07:10:30,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ff9462f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:10:30, skipping insertion in model container [2020-12-09 07:10:30,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:28" (2/3) ... [2020-12-09 07:10:30,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ff9462f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:10:30, skipping insertion in model container [2020-12-09 07:10:30,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:10:30" (3/3) ... [2020-12-09 07:10:30,748 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem14_label13.c [2020-12-09 07:10:30,758 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 07:10:30,760 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 07:10:30,767 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 07:10:30,785 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 07:10:30,785 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 07:10:30,785 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 07:10:30,785 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 07:10:30,786 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 07:10:30,786 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 07:10:30,786 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 07:10:30,786 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 07:10:30,799 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2020-12-09 07:10:30,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 07:10:30,803 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:10:30,804 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, 1] [2020-12-09 07:10:30,804 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:10:30,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:10:30,808 INFO L82 PathProgramCache]: Analyzing trace with hash -593706766, now seen corresponding path program 1 times [2020-12-09 07:10:30,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:10:30,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1990203130] [2020-12-09 07:10:30,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 07:10:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:10:30,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 07:10:30,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:10:30,950 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 07:10:30,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 07:10:30,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1990203130] [2020-12-09 07:10:30,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:10:30,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 07:10:30,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539856300] [2020-12-09 07:10:30,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:10:30,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:10:30,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:10:30,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:10:30,970 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 3 states. [2020-12-09 07:10:33,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:10:33,979 INFO L93 Difference]: Finished difference Result 685 states and 1216 transitions. [2020-12-09 07:10:33,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:10:33,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-12-09 07:10:33,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:10:33,990 INFO L225 Difference]: With dead ends: 685 [2020-12-09 07:10:33,990 INFO L226 Difference]: Without dead ends: 360 [2020-12-09 07:10:33,993 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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 07:10:34,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2020-12-09 07:10:34,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2020-12-09 07:10:34,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2020-12-09 07:10:34,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 510 transitions. [2020-12-09 07:10:34,032 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 510 transitions. Word has length 24 [2020-12-09 07:10:34,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:10:34,033 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 510 transitions. [2020-12-09 07:10:34,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:10:34,033 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 510 transitions. [2020-12-09 07:10:34,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-12-09 07:10:34,035 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:10:34,036 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:10:34,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 07:10:34,237 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:10:34,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:10:34,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1325573150, now seen corresponding path program 1 times [2020-12-09 07:10:34,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:10:34,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493047326] [2020-12-09 07:10:34,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 07:10:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:10:34,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 07:10:34,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:10:34,459 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:10:34,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 07:10:34,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493047326] [2020-12-09 07:10:34,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:10:34,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 07:10:34,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168417771] [2020-12-09 07:10:34,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:10:34,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:10:34,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:10:34,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:10:34,462 INFO L87 Difference]: Start difference. First operand 360 states and 510 transitions. Second operand 3 states. [2020-12-09 07:10:36,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:10:36,758 INFO L93 Difference]: Finished difference Result 896 states and 1232 transitions. [2020-12-09 07:10:36,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:10:36,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2020-12-09 07:10:36,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:10:36,762 INFO L225 Difference]: With dead ends: 896 [2020-12-09 07:10:36,762 INFO L226 Difference]: Without dead ends: 538 [2020-12-09 07:10:36,763 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 91 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 07:10:36,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-12-09 07:10:36,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2020-12-09 07:10:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2020-12-09 07:10:36,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 700 transitions. [2020-12-09 07:10:36,783 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 700 transitions. Word has length 93 [2020-12-09 07:10:36,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:10:36,783 INFO L481 AbstractCegarLoop]: Abstraction has 538 states and 700 transitions. [2020-12-09 07:10:36,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:10:36,783 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 700 transitions. [2020-12-09 07:10:36,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-12-09 07:10:36,788 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:10:36,788 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:10:36,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 07:10:36,990 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:10:36,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:10:36,992 INFO L82 PathProgramCache]: Analyzing trace with hash 219896516, now seen corresponding path program 1 times [2020-12-09 07:10:36,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:10:36,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291734379] [2020-12-09 07:10:36,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 07:10:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:10:37,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 07:10:37,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:10:37,225 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:10:37,225 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 07:10:37,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291734379] [2020-12-09 07:10:37,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:10:37,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 07:10:37,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038597318] [2020-12-09 07:10:37,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:10:37,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:10:37,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:10:37,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:10:37,227 INFO L87 Difference]: Start difference. First operand 538 states and 700 transitions. Second operand 3 states. [2020-12-09 07:10:40,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:10:40,689 INFO L93 Difference]: Finished difference Result 1252 states and 1691 transitions. [2020-12-09 07:10:40,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:10:40,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2020-12-09 07:10:40,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:10:40,693 INFO L225 Difference]: With dead ends: 1252 [2020-12-09 07:10:40,693 INFO L226 Difference]: Without dead ends: 894 [2020-12-09 07:10:40,694 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 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 07:10:40,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2020-12-09 07:10:40,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2020-12-09 07:10:40,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2020-12-09 07:10:40,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1110 transitions. [2020-12-09 07:10:40,708 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1110 transitions. Word has length 129 [2020-12-09 07:10:40,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:10:40,709 INFO L481 AbstractCegarLoop]: Abstraction has 894 states and 1110 transitions. [2020-12-09 07:10:40,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:10:40,709 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1110 transitions. [2020-12-09 07:10:40,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2020-12-09 07:10:40,712 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:10:40,712 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:10:40,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 07:10:40,914 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:10:40,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:10:40,916 INFO L82 PathProgramCache]: Analyzing trace with hash 250902610, now seen corresponding path program 1 times [2020-12-09 07:10:40,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:10:40,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431069497] [2020-12-09 07:10:40,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 07:10:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:10:41,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 07:10:41,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:10:41,180 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:10:41,181 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 07:10:41,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431069497] [2020-12-09 07:10:41,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:10:41,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:10:41,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946224880] [2020-12-09 07:10:41,182 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:10:41,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:10:41,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:10:41,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 07:10:41,183 INFO L87 Difference]: Start difference. First operand 894 states and 1110 transitions. Second operand 4 states. [2020-12-09 07:10:43,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:10:43,535 INFO L93 Difference]: Finished difference Result 1281 states and 1659 transitions. [2020-12-09 07:10:43,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:10:43,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2020-12-09 07:10:43,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:10:43,539 INFO L225 Difference]: With dead ends: 1281 [2020-12-09 07:10:43,539 INFO L226 Difference]: Without dead ends: 716 [2020-12-09 07:10:43,540 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 170 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 07:10:43,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2020-12-09 07:10:43,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2020-12-09 07:10:43,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2020-12-09 07:10:43,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 881 transitions. [2020-12-09 07:10:43,551 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 881 transitions. Word has length 173 [2020-12-09 07:10:43,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:10:43,551 INFO L481 AbstractCegarLoop]: Abstraction has 716 states and 881 transitions. [2020-12-09 07:10:43,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:10:43,551 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 881 transitions. [2020-12-09 07:10:43,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2020-12-09 07:10:43,555 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:10:43,555 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 07:10:43,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-09 07:10:43,757 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:10:43,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:10:43,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1762997576, now seen corresponding path program 1 times [2020-12-09 07:10:43,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:10:43,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649288627] [2020-12-09 07:10:43,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 07:10:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:10:43,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 07:10:43,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:10:44,162 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 65 proven. 131 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-12-09 07:10:44,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:10:44,949 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-12-09 07:10:44,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649288627] [2020-12-09 07:10:44,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 07:10:44,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-12-09 07:10:44,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445758797] [2020-12-09 07:10:44,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:10:44,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:10:44,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:10:44,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:10:44,951 INFO L87 Difference]: Start difference. First operand 716 states and 881 transitions. Second operand 3 states. [2020-12-09 07:10:50,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:10:50,245 INFO L93 Difference]: Finished difference Result 1430 states and 1920 transitions. [2020-12-09 07:10:50,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:10:50,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2020-12-09 07:10:50,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:10:50,250 INFO L225 Difference]: With dead ends: 1430 [2020-12-09 07:10:50,250 INFO L226 Difference]: Without dead ends: 1072 [2020-12-09 07:10:50,251 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 596 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:10:50,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2020-12-09 07:10:50,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2020-12-09 07:10:50,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2020-12-09 07:10:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1370 transitions. [2020-12-09 07:10:50,266 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1370 transitions. Word has length 301 [2020-12-09 07:10:50,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:10:50,266 INFO L481 AbstractCegarLoop]: Abstraction has 1072 states and 1370 transitions. [2020-12-09 07:10:50,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:10:50,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1370 transitions. [2020-12-09 07:10:50,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2020-12-09 07:10:50,270 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:10:50,270 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 07:10:50,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-09 07:10:50,471 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:10:50,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:10:50,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1235526109, now seen corresponding path program 1 times [2020-12-09 07:10:50,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:10:50,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1496103921] [2020-12-09 07:10:50,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 07:10:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:10:50,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 07:10:50,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:10:50,878 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 65 proven. 135 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-12-09 07:10:50,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:10:51,429 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-12-09 07:10:51,429 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1496103921] [2020-12-09 07:10:51,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 07:10:51,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-12-09 07:10:51,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460998681] [2020-12-09 07:10:51,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:10:51,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:10:51,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:10:51,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:10:51,431 INFO L87 Difference]: Start difference. First operand 1072 states and 1370 transitions. Second operand 3 states. [2020-12-09 07:10:57,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:10:57,908 INFO L93 Difference]: Finished difference Result 2320 states and 3161 transitions. [2020-12-09 07:10:57,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:10:57,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2020-12-09 07:10:57,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:10:57,915 INFO L225 Difference]: With dead ends: 2320 [2020-12-09 07:10:57,915 INFO L226 Difference]: Without dead ends: 1606 [2020-12-09 07:10:57,916 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 600 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 07:10:57,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2020-12-09 07:10:57,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2020-12-09 07:10:57,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1606 states. [2020-12-09 07:10:57,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2030 transitions. [2020-12-09 07:10:57,941 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2030 transitions. Word has length 303 [2020-12-09 07:10:57,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:10:57,941 INFO L481 AbstractCegarLoop]: Abstraction has 1606 states and 2030 transitions. [2020-12-09 07:10:57,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:10:57,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2030 transitions. [2020-12-09 07:10:57,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2020-12-09 07:10:57,944 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:10:57,944 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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 07:10:58,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-09 07:10:58,147 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:10:58,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:10:58,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1075700911, now seen corresponding path program 1 times [2020-12-09 07:10:58,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:10:58,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971376347] [2020-12-09 07:10:58,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 07:10:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:10:58,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 07:10:58,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:10:58,554 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 483 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-12-09 07:10:58,555 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 07:10:58,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971376347] [2020-12-09 07:10:58,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:10:58,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:10:58,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132922108] [2020-12-09 07:10:58,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:10:58,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:10:58,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:10:58,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:10:58,557 INFO L87 Difference]: Start difference. First operand 1606 states and 2030 transitions. Second operand 3 states. [2020-12-09 07:11:01,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:11:01,888 INFO L93 Difference]: Finished difference Result 3388 states and 4444 transitions. [2020-12-09 07:11:01,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:11:01,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 408 [2020-12-09 07:11:01,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:11:01,899 INFO L225 Difference]: With dead ends: 3388 [2020-12-09 07:11:01,899 INFO L226 Difference]: Without dead ends: 2140 [2020-12-09 07:11:01,901 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 406 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 07:11:01,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2020-12-09 07:11:01,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2140. [2020-12-09 07:11:01,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2020-12-09 07:11:01,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2666 transitions. [2020-12-09 07:11:01,940 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2666 transitions. Word has length 408 [2020-12-09 07:11:01,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:11:01,940 INFO L481 AbstractCegarLoop]: Abstraction has 2140 states and 2666 transitions. [2020-12-09 07:11:01,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:11:01,940 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2666 transitions. [2020-12-09 07:11:01,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2020-12-09 07:11:01,942 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:11:01,943 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:11:02,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-12-09 07:11:02,144 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:11:02,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:11:02,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1387250360, now seen corresponding path program 1 times [2020-12-09 07:11:02,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:11:02,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76297251] [2020-12-09 07:11:02,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 07:11:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:11:02,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 07:11:02,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:11:02,886 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 294 proven. 277 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-12-09 07:11:02,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:11:04,446 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 542 proven. 29 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2020-12-09 07:11:04,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76297251] [2020-12-09 07:11:04,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1332420453] [2020-12-09 07:11:04,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 07:11:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:11:04,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 07:11:04,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:11:05,028 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 07:11:05,029 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:11:05,029 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:11:05,033 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:11:05,039 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:11:05,040 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:11:05,042 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 07:11:05,045 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:11:05,047 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:11:05,258 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 358 proven. 22 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2020-12-09 07:11:05,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:11:05,472 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 07:11:05,472 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 07:11:05,779 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 358 proven. 22 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2020-12-09 07:11:05,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276768327] [2020-12-09 07:11:05,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 07:11:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:11:05,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 07:11:05,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:11:06,454 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 236 proven. 144 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2020-12-09 07:11:06,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:11:06,932 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 236 proven. 144 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2020-12-09 07:11:06,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 07:11:06,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 7, 7, 4, 4] total 18 [2020-12-09 07:11:06,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383546727] [2020-12-09 07:11:06,935 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-09 07:11:06,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:11:06,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-09 07:11:06,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2020-12-09 07:11:06,936 INFO L87 Difference]: Start difference. First operand 2140 states and 2666 transitions. Second operand 18 states. [2020-12-09 07:11:08,650 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2020-12-09 07:11:21,539 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 17 [2020-12-09 07:11:22,147 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 17 [2020-12-09 07:11:38,883 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2020-12-09 07:11:42,649 WARN L197 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2020-12-09 07:11:43,686 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2020-12-09 07:12:11,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:12:11,217 INFO L93 Difference]: Finished difference Result 5961 states and 7555 transitions. [2020-12-09 07:12:11,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-09 07:12:11,221 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 430 [2020-12-09 07:12:11,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:12:11,233 INFO L225 Difference]: With dead ends: 5961 [2020-12-09 07:12:11,233 INFO L226 Difference]: Without dead ends: 3920 [2020-12-09 07:12:11,235 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2591 GetRequests, 2561 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2020-12-09 07:12:11,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2020-12-09 07:12:11,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3564. [2020-12-09 07:12:11,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2020-12-09 07:12:11,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3861 transitions. [2020-12-09 07:12:11,276 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3861 transitions. Word has length 430 [2020-12-09 07:12:11,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:12:11,276 INFO L481 AbstractCegarLoop]: Abstraction has 3564 states and 3861 transitions. [2020-12-09 07:12:11,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-09 07:12:11,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3861 transitions. [2020-12-09 07:12:11,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2020-12-09 07:12:11,280 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:12:11,281 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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 07:12:11,882 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 07:12:11,884 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:12:11,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:12:11,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1963942921, now seen corresponding path program 1 times [2020-12-09 07:12:11,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:12:11,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906167914] [2020-12-09 07:12:11,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 07:12:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:12:12,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 07:12:12,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:12:14,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1224 backedges. 109 proven. 898 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2020-12-09 07:12:14,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:12:15,717 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 6, 2, 1] term [2020-12-09 07:12:15,717 INFO L639 QuantifierPusher]: Distributing 6 disjuncts over 7 conjuncts [2020-12-09 07:12:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1224 backedges. 739 proven. 268 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2020-12-09 07:12:18,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906167914] [2020-12-09 07:12:18,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2055304162] [2020-12-09 07:12:18,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 07:12:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:12:19,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 07:12:19,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:12:19,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1224 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2020-12-09 07:12:19,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 07:12:19,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 07:12:19,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10, 10] total 21 [2020-12-09 07:12:19,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402672587] [2020-12-09 07:12:19,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:12:19,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:12:19,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:12:19,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-12-09 07:12:19,615 INFO L87 Difference]: Start difference. First operand 3564 states and 3861 transitions. Second operand 4 states. [2020-12-09 07:12:21,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:12:21,957 INFO L93 Difference]: Finished difference Result 7501 states and 8278 transitions. [2020-12-09 07:12:21,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:12:21,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 678 [2020-12-09 07:12:21,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:12:21,972 INFO L225 Difference]: With dead ends: 7501 [2020-12-09 07:12:21,972 INFO L226 Difference]: Without dead ends: 4651 [2020-12-09 07:12:21,974 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2031 GetRequests, 1995 SyntacticMatches, 17 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-12-09 07:12:21,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4651 states. [2020-12-09 07:12:22,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4651 to 4632. [2020-12-09 07:12:22,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2020-12-09 07:12:22,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4995 transitions. [2020-12-09 07:12:22,029 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4995 transitions. Word has length 678 [2020-12-09 07:12:22,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:12:22,029 INFO L481 AbstractCegarLoop]: Abstraction has 4632 states and 4995 transitions. [2020-12-09 07:12:22,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:12:22,030 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4995 transitions. [2020-12-09 07:12:22,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 754 [2020-12-09 07:12:22,035 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:12:22,035 INFO L422 BasicCegarLoop]: trace histogram [7, 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, 5, 5, 5, 5, 5, 5, 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 07:12:22,436 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 07:12:22,437 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:12:22,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:12:22,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1496891286, now seen corresponding path program 1 times [2020-12-09 07:12:22,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:12:22,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772198556] [2020-12-09 07:12:22,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 07:12:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:12:22,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 07:12:22,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:12:25,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1620 backedges. 483 proven. 898 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2020-12-09 07:12:25,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:12:26,369 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 6, 2, 1] term [2020-12-09 07:12:26,370 INFO L639 QuantifierPusher]: Distributing 6 disjuncts over 7 conjuncts [2020-12-09 07:12:29,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1620 backedges. 1113 proven. 268 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2020-12-09 07:12:29,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772198556] [2020-12-09 07:12:29,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1271646090] [2020-12-09 07:12:29,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 07:12:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:12:29,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 07:12:29,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:12:30,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1620 backedges. 483 proven. 22 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2020-12-09 07:12:30,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:12:31,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1620 backedges. 483 proven. 22 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2020-12-09 07:12:31,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644580836] [2020-12-09 07:12:31,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 07:12:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:12:31,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 843 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 07:12:31,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:12:31,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1620 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 1489 trivial. 0 not checked. [2020-12-09 07:12:31,878 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 07:12:31,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2020-12-09 07:12:31,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10, 10, 5, 5] total 23 [2020-12-09 07:12:31,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613409276] [2020-12-09 07:12:31,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:12:31,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:12:31,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:12:31,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2020-12-09 07:12:31,881 INFO L87 Difference]: Start difference. First operand 4632 states and 4995 transitions. Second operand 3 states. [2020-12-09 07:12:35,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:12:35,549 INFO L93 Difference]: Finished difference Result 9440 states and 10233 transitions. [2020-12-09 07:12:35,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:12:35,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 753 [2020-12-09 07:12:35,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:12:35,568 INFO L225 Difference]: With dead ends: 9440 [2020-12-09 07:12:35,568 INFO L226 Difference]: Without dead ends: 5522 [2020-12-09 07:12:35,571 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3760 GetRequests, 3728 SyntacticMatches, 11 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2020-12-09 07:12:35,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5522 states. [2020-12-09 07:12:35,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5522 to 5522. [2020-12-09 07:12:35,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5522 states. [2020-12-09 07:12:35,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 5901 transitions. [2020-12-09 07:12:35,634 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 5901 transitions. Word has length 753 [2020-12-09 07:12:35,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:12:35,635 INFO L481 AbstractCegarLoop]: Abstraction has 5522 states and 5901 transitions. [2020-12-09 07:12:35,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:12:35,636 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 5901 transitions. [2020-12-09 07:12:35,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2020-12-09 07:12:35,641 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:12:35,641 INFO L422 BasicCegarLoop]: trace histogram [7, 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, 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 07:12:36,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 mathsat -unsat_core_generation=3,15 cvc4 --incremental --print-success --lang smt [2020-12-09 07:12:36,243 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:12:36,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:12:36,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1471494814, now seen corresponding path program 1 times [2020-12-09 07:12:36,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:12:36,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071791647] [2020-12-09 07:12:36,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2020-12-09 07:12:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:12:36,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 07:12:36,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:12:37,665 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2020-12-09 07:12:37,749 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 6, 1] term [2020-12-09 07:12:37,750 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 7 disjuncts [2020-12-09 07:12:39,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1655 backedges. 0 proven. 1416 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2020-12-09 07:12:39,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:12:40,602 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 6, 2, 1] term [2020-12-09 07:12:40,602 INFO L639 QuantifierPusher]: Distributing 6 disjuncts over 7 conjuncts [2020-12-09 07:12:43,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1655 backedges. 850 proven. 566 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2020-12-09 07:12:43,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071791647] [2020-12-09 07:12:43,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1819968871] [2020-12-09 07:12:43,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt [2020-12-09 07:12:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:12:44,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 07:12:44,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:12:44,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1655 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 1524 trivial. 0 not checked. [2020-12-09 07:12:44,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 07:12:44,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 07:12:44,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11, 11] total 21 [2020-12-09 07:12:44,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302979122] [2020-12-09 07:12:44,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:12:44,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:12:44,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:12:44,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2020-12-09 07:12:44,666 INFO L87 Difference]: Start difference. First operand 5522 states and 5901 transitions. Second operand 3 states. [2020-12-09 07:12:46,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:12:46,578 INFO L93 Difference]: Finished difference Result 11932 states and 12929 transitions. [2020-12-09 07:12:46,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:12:46,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 760 [2020-12-09 07:12:46,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:12:46,595 INFO L225 Difference]: With dead ends: 11932 [2020-12-09 07:12:46,595 INFO L226 Difference]: Without dead ends: 5166 [2020-12-09 07:12:46,599 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2277 GetRequests, 2243 SyntacticMatches, 15 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 07:12:46,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2020-12-09 07:12:46,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 5166. [2020-12-09 07:12:46,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5166 states. [2020-12-09 07:12:46,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 5440 transitions. [2020-12-09 07:12:46,651 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 5440 transitions. Word has length 760 [2020-12-09 07:12:46,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:12:46,651 INFO L481 AbstractCegarLoop]: Abstraction has 5166 states and 5440 transitions. [2020-12-09 07:12:46,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:12:46,652 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 5440 transitions. [2020-12-09 07:12:46,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 767 [2020-12-09 07:12:46,657 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:12:46,657 INFO L422 BasicCegarLoop]: trace histogram [7, 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, 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 07:12:47,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3,18 cvc4 --incremental --print-success --lang smt [2020-12-09 07:12:47,059 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:12:47,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:12:47,061 INFO L82 PathProgramCache]: Analyzing trace with hash 176546479, now seen corresponding path program 1 times [2020-12-09 07:12:47,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:12:47,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796930646] [2020-12-09 07:12:47,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2020-12-09 07:12:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:12:47,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 07:12:47,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:12:49,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1685 backedges. 548 proven. 898 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2020-12-09 07:12:49,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:12:51,005 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 6, 2, 1] term [2020-12-09 07:12:51,005 INFO L639 QuantifierPusher]: Distributing 6 disjuncts over 7 conjuncts [2020-12-09 07:12:54,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1685 backedges. 1178 proven. 268 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2020-12-09 07:12:54,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796930646] [2020-12-09 07:12:54,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [165712305] [2020-12-09 07:12:54,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt [2020-12-09 07:12:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:12:54,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 07:12:54,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:12:55,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1685 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 1554 trivial. 0 not checked. [2020-12-09 07:12:55,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 07:12:55,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 07:12:55,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10, 10] total 21 [2020-12-09 07:12:55,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360486697] [2020-12-09 07:12:55,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:12:55,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:12:55,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:12:55,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2020-12-09 07:12:55,452 INFO L87 Difference]: Start difference. First operand 5166 states and 5440 transitions. Second operand 4 states. [2020-12-09 07:12:58,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:12:58,668 INFO L93 Difference]: Finished difference Result 10556 states and 11187 transitions. [2020-12-09 07:12:58,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 07:12:58,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 766 [2020-12-09 07:12:58,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:12:58,684 INFO L225 Difference]: With dead ends: 10556 [2020-12-09 07:12:58,684 INFO L226 Difference]: Without dead ends: 4810 [2020-12-09 07:12:58,688 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2297 GetRequests, 2258 SyntacticMatches, 19 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2020-12-09 07:12:58,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2020-12-09 07:12:58,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4810. [2020-12-09 07:12:58,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2020-12-09 07:12:58,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 4983 transitions. [2020-12-09 07:12:58,724 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 4983 transitions. Word has length 766 [2020-12-09 07:12:58,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:12:58,725 INFO L481 AbstractCegarLoop]: Abstraction has 4810 states and 4983 transitions. [2020-12-09 07:12:58,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:12:58,725 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 4983 transitions. [2020-12-09 07:12:58,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2020-12-09 07:12:58,730 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:12:58,730 INFO L422 BasicCegarLoop]: trace histogram [7, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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 07:12:59,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3,20 cvc4 --incremental --print-success --lang smt [2020-12-09 07:12:59,133 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:12:59,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:12:59,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1177769681, now seen corresponding path program 1 times [2020-12-09 07:12:59,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:12:59,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652556796] [2020-12-09 07:12:59,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 07:12:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:12:59,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 870 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 07:12:59,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:13:02,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1745 backedges. 608 proven. 898 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2020-12-09 07:13:02,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:13:03,056 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 6, 2, 1] term [2020-12-09 07:13:03,056 INFO L639 QuantifierPusher]: Distributing 6 disjuncts over 7 conjuncts [2020-12-09 07:13:06,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1745 backedges. 1238 proven. 268 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2020-12-09 07:13:06,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652556796] [2020-12-09 07:13:06,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1750635180] [2020-12-09 07:13:06,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 07:13:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:13:06,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 870 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 07:13:06,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:13:07,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1745 backedges. 0 proven. 1506 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2020-12-09 07:13:07,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:13:09,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1745 backedges. 872 proven. 634 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2020-12-09 07:13:09,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950118150] [2020-12-09 07:13:09,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 07:13:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:13:09,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 870 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 07:13:09,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:13:10,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1745 backedges. 131 proven. 1397 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2020-12-09 07:13:10,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:13:12,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1745 backedges. 960 proven. 568 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2020-12-09 07:13:12,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 07:13:12,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 5, 5, 5, 5] total 25 [2020-12-09 07:13:12,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469186785] [2020-12-09 07:13:12,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-12-09 07:13:12,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:13:12,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-12-09 07:13:12,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2020-12-09 07:13:12,277 INFO L87 Difference]: Start difference. First operand 4810 states and 4983 transitions. Second operand 25 states. [2020-12-09 07:13:26,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:13:26,759 INFO L93 Difference]: Finished difference Result 11024 states and 11468 transitions. [2020-12-09 07:13:26,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-09 07:13:26,759 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 778 [2020-12-09 07:13:26,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:13:26,769 INFO L225 Difference]: With dead ends: 11024 [2020-12-09 07:13:26,769 INFO L226 Difference]: Without dead ends: 6928 [2020-12-09 07:13:26,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4672 GetRequests, 4626 SyntacticMatches, 18 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2020-12-09 07:13:26,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6928 states. [2020-12-09 07:13:26,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6928 to 5513. [2020-12-09 07:13:26,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5513 states. [2020-12-09 07:13:26,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5513 states to 5513 states and 5732 transitions. [2020-12-09 07:13:26,820 INFO L78 Accepts]: Start accepts. Automaton has 5513 states and 5732 transitions. Word has length 778 [2020-12-09 07:13:26,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:13:26,821 INFO L481 AbstractCegarLoop]: Abstraction has 5513 states and 5732 transitions. [2020-12-09 07:13:26,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-12-09 07:13:26,821 INFO L276 IsEmpty]: Start isEmpty. Operand 5513 states and 5732 transitions. [2020-12-09 07:13:26,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 919 [2020-12-09 07:13:26,828 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:13:26,828 INFO L422 BasicCegarLoop]: trace histogram [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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 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, 2, 2, 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] [2020-12-09 07:13:27,430 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 07:13:27,432 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:13:27,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:13:27,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1117256400, now seen corresponding path program 1 times [2020-12-09 07:13:27,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:13:27,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740271966] [2020-12-09 07:13:27,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 07:13:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:13:27,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 07:13:27,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:13:31,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 1456 proven. 420 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2020-12-09 07:13:31,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:13:32,079 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 6, 1] term [2020-12-09 07:13:32,079 INFO L639 QuantifierPusher]: Distributing 6 disjuncts over 7 conjuncts [2020-12-09 07:13:34,918 WARN L197 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 19 DAG size of output: 7 [2020-12-09 07:13:37,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 1876 proven. 0 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2020-12-09 07:13:37,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740271966] [2020-12-09 07:13:37,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 07:13:37,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 19 [2020-12-09 07:13:37,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569999008] [2020-12-09 07:13:37,547 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 07:13:37,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:13:37,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 07:13:37,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2020-12-09 07:13:37,548 INFO L87 Difference]: Start difference. First operand 5513 states and 5732 transitions. Second operand 11 states. [2020-12-09 07:13:41,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:13:41,619 INFO L93 Difference]: Finished difference Result 10832 states and 11270 transitions. [2020-12-09 07:13:41,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 07:13:41,622 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 918 [2020-12-09 07:13:41,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:13:41,629 INFO L225 Difference]: With dead ends: 10832 [2020-12-09 07:13:41,629 INFO L226 Difference]: Without dead ends: 5668 [2020-12-09 07:13:41,632 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1834 GetRequests, 1770 SyntacticMatches, 46 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2020-12-09 07:13:41,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5668 states. [2020-12-09 07:13:41,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5668 to 5668. [2020-12-09 07:13:41,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5668 states. [2020-12-09 07:13:41,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5668 states to 5668 states and 5888 transitions. [2020-12-09 07:13:41,683 INFO L78 Accepts]: Start accepts. Automaton has 5668 states and 5888 transitions. Word has length 918 [2020-12-09 07:13:41,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:13:41,684 INFO L481 AbstractCegarLoop]: Abstraction has 5668 states and 5888 transitions. [2020-12-09 07:13:41,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 07:13:41,684 INFO L276 IsEmpty]: Start isEmpty. Operand 5668 states and 5888 transitions. [2020-12-09 07:13:41,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 996 [2020-12-09 07:13:41,692 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:13:41,692 INFO L422 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 2, 2, 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 07:13:41,893 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2020-12-09 07:13:41,893 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:13:41,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:13:41,893 INFO L82 PathProgramCache]: Analyzing trace with hash -498448390, now seen corresponding path program 1 times [2020-12-09 07:13:41,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:13:41,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061712110] [2020-12-09 07:13:41,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2020-12-09 07:13:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:13:42,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 07:13:42,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:13:45,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2910 backedges. 1490 proven. 1115 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2020-12-09 07:13:45,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:13:46,354 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 6, 1] term [2020-12-09 07:13:46,354 INFO L639 QuantifierPusher]: Distributing 6 disjuncts over 7 conjuncts [2020-12-09 07:13:47,029 WARN L197 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2020-12-09 07:13:47,563 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2020-12-09 07:13:57,589 WARN L197 SmtUtils]: Spent 2.53 s on a formula simplification that was a NOOP. DAG size: 20 [2020-12-09 07:14:01,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2910 backedges. 2032 proven. 0 refuted. 573 times theorem prover too weak. 305 trivial. 0 not checked. [2020-12-09 07:14:01,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061712110] [2020-12-09 07:14:01,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1327888396] [2020-12-09 07:14:01,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt [2020-12-09 07:14:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:14:01,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 07:14:01,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:14:03,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2910 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 2512 trivial. 0 not checked. [2020-12-09 07:14:03,863 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 07:14:03,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 07:14:03,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11, 11] total 24 [2020-12-09 07:14:03,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249573743] [2020-12-09 07:14:03,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:14:03,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:14:03,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:14:03,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=350, Unknown=2, NotChecked=0, Total=552 [2020-12-09 07:14:03,866 INFO L87 Difference]: Start difference. First operand 5668 states and 5888 transitions. Second operand 4 states. [2020-12-09 07:14:05,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:14:05,710 INFO L93 Difference]: Finished difference Result 6916 states and 7236 transitions. [2020-12-09 07:14:05,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 07:14:05,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 995 [2020-12-09 07:14:05,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:14:05,721 INFO L225 Difference]: With dead ends: 6916 [2020-12-09 07:14:05,721 INFO L226 Difference]: Without dead ends: 6914 [2020-12-09 07:14:05,725 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2984 GetRequests, 2943 SyntacticMatches, 18 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=218, Invalid=380, Unknown=2, NotChecked=0, Total=600 [2020-12-09 07:14:05,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6914 states. [2020-12-09 07:14:05,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6914 to 5846. [2020-12-09 07:14:05,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5846 states. [2020-12-09 07:14:05,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5846 states to 5846 states and 6089 transitions. [2020-12-09 07:14:05,777 INFO L78 Accepts]: Start accepts. Automaton has 5846 states and 6089 transitions. Word has length 995 [2020-12-09 07:14:05,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:14:05,778 INFO L481 AbstractCegarLoop]: Abstraction has 5846 states and 6089 transitions. [2020-12-09 07:14:05,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:14:05,778 INFO L276 IsEmpty]: Start isEmpty. Operand 5846 states and 6089 transitions. [2020-12-09 07:14:05,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1049 [2020-12-09 07:14:05,788 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:14:05,788 INFO L422 BasicCegarLoop]: trace histogram [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, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:14:06,189 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt,25 mathsat -unsat_core_generation=3 [2020-12-09 07:14:06,190 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:14:06,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:14:06,192 INFO L82 PathProgramCache]: Analyzing trace with hash -77264109, now seen corresponding path program 1 times [2020-12-09 07:14:06,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:14:06,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1385062951] [2020-12-09 07:14:06,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 07:14:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:14:06,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 07:14:06,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:14:10,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3116 backedges. 1643 proven. 1115 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2020-12-09 07:14:10,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:14:11,031 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 6, 1] term [2020-12-09 07:14:11,032 INFO L639 QuantifierPusher]: Distributing 6 disjuncts over 7 conjuncts [2020-12-09 07:14:11,815 WARN L197 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2020-12-09 07:14:12,371 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2020-12-09 07:14:22,333 WARN L197 SmtUtils]: Spent 2.50 s on a formula simplification that was a NOOP. DAG size: 20 [2020-12-09 07:14:26,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3116 backedges. 2185 proven. 0 refuted. 573 times theorem prover too weak. 358 trivial. 0 not checked. [2020-12-09 07:14:26,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1385062951] [2020-12-09 07:14:26,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [136867018] [2020-12-09 07:14:26,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt [2020-12-09 07:14:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:14:27,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 07:14:27,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:14:27,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3116 backedges. 1577 proven. 0 refuted. 0 times theorem prover too weak. 1539 trivial. 0 not checked. [2020-12-09 07:14:27,980 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 07:14:27,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 07:14:27,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11, 11] total 23 [2020-12-09 07:14:27,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840715258] [2020-12-09 07:14:27,982 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:14:27,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:14:27,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:14:27,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=340, Unknown=2, NotChecked=0, Total=506 [2020-12-09 07:14:27,982 INFO L87 Difference]: Start difference. First operand 5846 states and 6089 transitions. Second operand 3 states. [2020-12-09 07:14:29,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:14:29,321 INFO L93 Difference]: Finished difference Result 11690 states and 12199 transitions. [2020-12-09 07:14:29,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:14:29,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1048 [2020-12-09 07:14:29,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:14:29,335 INFO L225 Difference]: With dead ends: 11690 [2020-12-09 07:14:29,335 INFO L226 Difference]: Without dead ends: 6202 [2020-12-09 07:14:29,339 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3141 GetRequests, 3093 SyntacticMatches, 27 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=164, Invalid=340, Unknown=2, NotChecked=0, Total=506 [2020-12-09 07:14:29,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6202 states. [2020-12-09 07:14:29,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6202 to 4778. [2020-12-09 07:14:29,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4778 states. [2020-12-09 07:14:29,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4778 states to 4778 states and 4961 transitions. [2020-12-09 07:14:29,384 INFO L78 Accepts]: Start accepts. Automaton has 4778 states and 4961 transitions. Word has length 1048 [2020-12-09 07:14:29,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:14:29,384 INFO L481 AbstractCegarLoop]: Abstraction has 4778 states and 4961 transitions. [2020-12-09 07:14:29,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:14:29,384 INFO L276 IsEmpty]: Start isEmpty. Operand 4778 states and 4961 transitions. [2020-12-09 07:14:29,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1096 [2020-12-09 07:14:29,394 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:14:29,395 INFO L422 BasicCegarLoop]: trace histogram [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, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 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, 2, 2, 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 07:14:29,795 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 cvc4 --incremental --print-success --lang smt,27 mathsat -unsat_core_generation=3 [2020-12-09 07:14:29,796 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:14:29,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:14:29,798 INFO L82 PathProgramCache]: Analyzing trace with hash -18291372, now seen corresponding path program 1 times [2020-12-09 07:14:29,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:14:29,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1233459685] [2020-12-09 07:14:29,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 07:14:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:14:30,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 1211 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-09 07:14:30,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:14:33,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3683 backedges. 2066 proven. 1115 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2020-12-09 07:14:33,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:14:34,661 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 6, 1] term [2020-12-09 07:14:34,661 INFO L639 QuantifierPusher]: Distributing 6 disjuncts over 7 conjuncts [2020-12-09 07:14:35,367 WARN L197 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2020-12-09 07:14:35,969 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2020-12-09 07:14:46,119 WARN L197 SmtUtils]: Spent 2.36 s on a formula simplification that was a NOOP. DAG size: 20 [2020-12-09 07:14:50,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3683 backedges. 2608 proven. 0 refuted. 573 times theorem prover too weak. 502 trivial. 0 not checked. [2020-12-09 07:14:50,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1233459685] [2020-12-09 07:14:50,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [431402890] [2020-12-09 07:14:50,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 07:14:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:14:50,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 1211 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 07:14:50,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:14:51,603 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:14:51,604 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:14:52,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3683 backedges. 926 proven. 22 refuted. 0 times theorem prover too weak. 2735 trivial. 0 not checked. [2020-12-09 07:14:52,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:14:53,350 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-12-09 07:14:53,350 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 07:14:53,351 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 07:14:53,352 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 07:14:53,352 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 07:14:53,355 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 07:14:53,356 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 07:14:53,357 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 07:14:53,358 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 07:14:54,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3683 backedges. 942 proven. 6 refuted. 0 times theorem prover too weak. 2735 trivial. 0 not checked. [2020-12-09 07:14:54,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137368299] [2020-12-09 07:14:54,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 07:14:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:14:54,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 1211 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 07:14:54,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:14:57,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3683 backedges. 1013 proven. 704 refuted. 0 times theorem prover too weak. 1966 trivial. 0 not checked. [2020-12-09 07:14:57,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:14:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3683 backedges. 1013 proven. 704 refuted. 0 times theorem prover too weak. 1966 trivial. 0 not checked. [2020-12-09 07:14:58,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 07:14:58,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 7, 7, 5, 5] total 34 [2020-12-09 07:14:58,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219346939] [2020-12-09 07:14:58,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-12-09 07:14:58,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:14:58,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-12-09 07:14:58,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=879, Unknown=2, NotChecked=0, Total=1122 [2020-12-09 07:14:58,805 INFO L87 Difference]: Start difference. First operand 4778 states and 4961 transitions. Second operand 34 states. [2020-12-09 07:15:09,381 WARN L197 SmtUtils]: Spent 2.62 s on a formula simplification that was a NOOP. DAG size: 27 [2020-12-09 07:15:28,121 WARN L197 SmtUtils]: Spent 2.77 s on a formula simplification that was a NOOP. DAG size: 33 [2020-12-09 07:15:37,174 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2020-12-09 07:20:03,430 WARN L197 SmtUtils]: Spent 3.03 s on a formula simplification that was a NOOP. DAG size: 36 [2020-12-09 07:21:16,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:21:16,933 INFO L93 Difference]: Finished difference Result 9583 states and 9926 transitions. [2020-12-09 07:21:16,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-12-09 07:21:16,937 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1095 [2020-12-09 07:21:16,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:21:16,941 INFO L225 Difference]: With dead ends: 9583 [2020-12-09 07:21:16,941 INFO L226 Difference]: Without dead ends: 4915 [2020-12-09 07:21:16,944 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6584 GetRequests, 6520 SyntacticMatches, 20 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 37.5s TimeCoverageRelationStatistics Valid=382, Invalid=1683, Unknown=5, NotChecked=0, Total=2070 [2020-12-09 07:21:16,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4915 states. [2020-12-09 07:21:16,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4915 to 4316. [2020-12-09 07:21:16,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4316 states. [2020-12-09 07:21:16,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4316 states to 4316 states and 4449 transitions. [2020-12-09 07:21:16,982 INFO L78 Accepts]: Start accepts. Automaton has 4316 states and 4449 transitions. Word has length 1095 [2020-12-09 07:21:16,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:21:16,983 INFO L481 AbstractCegarLoop]: Abstraction has 4316 states and 4449 transitions. [2020-12-09 07:21:16,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-12-09 07:21:16,983 INFO L276 IsEmpty]: Start isEmpty. Operand 4316 states and 4449 transitions. [2020-12-09 07:21:16,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1180 [2020-12-09 07:21:16,993 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:21:16,994 INFO L422 BasicCegarLoop]: trace histogram [11, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 07:21:17,595 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 07:21:17,596 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:21:17,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:21:17,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1450741392, now seen corresponding path program 1 times [2020-12-09 07:21:17,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:21:17,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505766509] [2020-12-09 07:21:17,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/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 07:21:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:21:17,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 1308 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-09 07:21:17,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:21:18,783 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2020-12-09 07:21:18,973 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2020-12-09 07:21:19,179 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2020-12-09 07:21:19,434 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2020-12-09 07:21:19,448 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 6, 1] term [2020-12-09 07:21:19,448 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 7 disjuncts [2020-12-09 07:21:22,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4532 backedges. 1908 proven. 2299 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2020-12-09 07:21:22,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:21:23,266 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 6, 3, 1] term [2020-12-09 07:21:23,266 INFO L639 QuantifierPusher]: Distributing 6 disjuncts over 7 conjuncts [2020-12-09 07:21:27,179 WARN L197 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 3 [2020-12-09 07:21:30,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4532 backedges. 3654 proven. 190 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2020-12-09 07:21:30,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505766509] [2020-12-09 07:21:30,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [355880313] [2020-12-09 07:21:30,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/cvc4 Starting monitored process 33 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4 --incremental --print-success --lang smt [2020-12-09 07:21:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:21:30,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 1308 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 07:21:30,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:21:31,441 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:21:31,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 07:21:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4532 backedges. 1718 proven. 71 refuted. 0 times theorem prover too weak. 2743 trivial. 0 not checked. [2020-12-09 07:21:32,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:21:32,998 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2020-12-09 07:21:33,009 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-12-09 07:21:33,010 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 07:21:33,011 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 07:21:33,013 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 07:21:33,014 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 07:21:33,017 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 07:21:33,019 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 07:21:33,020 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 07:21:33,021 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 07:21:34,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4532 backedges. 1769 proven. 20 refuted. 0 times theorem prover too weak. 2743 trivial. 0 not checked. [2020-12-09 07:21:34,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541928060] [2020-12-09 07:21:34,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 07:21:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:21:34,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 1308 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 07:21:34,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:21:36,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4532 backedges. 1124 proven. 716 refuted. 0 times theorem prover too weak. 2692 trivial. 0 not checked. [2020-12-09 07:21:36,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:21:38,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4532 backedges. 1124 proven. 716 refuted. 0 times theorem prover too weak. 2692 trivial. 0 not checked. [2020-12-09 07:21:38,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 07:21:38,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 7, 7, 4, 4] total 35 [2020-12-09 07:21:38,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124009618] [2020-12-09 07:21:38,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-12-09 07:21:38,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:21:38,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-12-09 07:21:38,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2020-12-09 07:21:38,119 INFO L87 Difference]: Start difference. First operand 4316 states and 4449 transitions. Second operand 35 states. [2020-12-09 07:21:38,413 WARN L197 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2020-12-09 07:21:47,349 WARN L197 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2020-12-09 07:21:48,996 WARN L197 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2020-12-09 07:21:49,557 WARN L197 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2020-12-09 07:21:50,261 WARN L197 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2020-12-09 07:21:50,794 WARN L197 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2020-12-09 07:21:51,326 WARN L197 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2020-12-09 07:21:51,479 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2020-12-09 07:21:51,829 WARN L197 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2020-12-09 07:22:03,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:22:03,095 INFO L93 Difference]: Finished difference Result 8421 states and 8659 transitions. [2020-12-09 07:22:03,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-12-09 07:22:03,100 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 1179 [2020-12-09 07:22:03,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:22:03,103 INFO L225 Difference]: With dead ends: 8421 [2020-12-09 07:22:03,103 INFO L226 Difference]: Without dead ends: 3970 [2020-12-09 07:22:03,106 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7101 GetRequests, 7046 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=610, Invalid=2470, Unknown=0, NotChecked=0, Total=3080 [2020-12-09 07:22:03,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3970 states. [2020-12-09 07:22:03,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3970 to 3384. [2020-12-09 07:22:03,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3384 states. [2020-12-09 07:22:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3384 states to 3384 states and 3439 transitions. [2020-12-09 07:22:03,140 INFO L78 Accepts]: Start accepts. Automaton has 3384 states and 3439 transitions. Word has length 1179 [2020-12-09 07:22:03,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:22:03,141 INFO L481 AbstractCegarLoop]: Abstraction has 3384 states and 3439 transitions. [2020-12-09 07:22:03,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-12-09 07:22:03,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3384 states and 3439 transitions. [2020-12-09 07:22:03,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1483 [2020-12-09 07:22:03,155 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:22:03,156 INFO L422 BasicCegarLoop]: trace histogram [13, 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, 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, 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 07:22:03,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 cvc4 --incremental --print-success --lang smt,32 mathsat -unsat_core_generation=3,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 07:22:03,758 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:22:03,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:22:03,760 INFO L82 PathProgramCache]: Analyzing trace with hash -496624054, now seen corresponding path program 1 times [2020-12-09 07:22:03,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:22:03,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510551855] [2020-12-09 07:22:03,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/mathsat Starting monitored process 35 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with mathsat -unsat_core_generation=3 [2020-12-09 07:22:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 07:22:04,144 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 07:22:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 07:22:04,488 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 07:22:04,963 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-12-09 07:22:04,963 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 07:22:05,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 mathsat -unsat_core_generation=3 [2020-12-09 07:22:05,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:22:05 BoogieIcfgContainer [2020-12-09 07:22:05,556 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 07:22:05,556 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 07:22:05,556 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 07:22:05,556 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 07:22:05,557 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:10:30" (3/4) ... [2020-12-09 07:22:05,558 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 07:22:05,910 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e2123155-6c01-49c6-bebd-b1c796827455/bin/utaipan/witness.graphml [2020-12-09 07:22:05,910 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 07:22:05,911 INFO L168 Benchmark]: Toolchain (without parser) took 698291.91 ms. Allocated memory was 75.5 MB in the beginning and 604.0 MB in the end (delta: 528.5 MB). Free memory was 59.5 MB in the beginning and 226.2 MB in the end (delta: -166.7 MB). Peak memory consumption was 358.9 MB. Max. memory is 16.1 GB. [2020-12-09 07:22:05,911 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 75.5 MB. Free memory is still 57.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 07:22:05,912 INFO L168 Benchmark]: CACSL2BoogieTranslator took 500.32 ms. Allocated memory was 75.5 MB in the beginning and 109.1 MB in the end (delta: 33.6 MB). Free memory was 59.2 MB in the beginning and 83.3 MB in the end (delta: -24.0 MB). Peak memory consumption was 24.2 MB. Max. memory is 16.1 GB. [2020-12-09 07:22:05,912 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.61 ms. Allocated memory is still 109.1 MB. Free memory was 83.3 MB in the beginning and 77.0 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-09 07:22:05,912 INFO L168 Benchmark]: Boogie Preprocessor took 54.47 ms. Allocated memory is still 109.1 MB. Free memory was 77.0 MB in the beginning and 71.6 MB in the end (delta: 5.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-09 07:22:05,912 INFO L168 Benchmark]: RCFGBuilder took 2500.94 ms. Allocated memory is still 109.1 MB. Free memory was 71.6 MB in the beginning and 72.5 MB in the end (delta: -828.6 kB). Peak memory consumption was 39.5 MB. Max. memory is 16.1 GB. [2020-12-09 07:22:05,912 INFO L168 Benchmark]: TraceAbstraction took 694813.47 ms. Allocated memory was 109.1 MB in the beginning and 604.0 MB in the end (delta: 494.9 MB). Free memory was 72.5 MB in the beginning and 398.0 MB in the end (delta: -325.6 MB). Peak memory consumption was 513.7 MB. Max. memory is 16.1 GB. [2020-12-09 07:22:05,913 INFO L168 Benchmark]: Witness Printer took 354.37 ms. Allocated memory is still 604.0 MB. Free memory was 398.0 MB in the beginning and 226.2 MB in the end (delta: 171.9 MB). Peak memory consumption was 169.9 MB. Max. memory is 16.1 GB. [2020-12-09 07:22:05,914 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 75.5 MB. Free memory is still 57.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 500.32 ms. Allocated memory was 75.5 MB in the beginning and 109.1 MB in the end (delta: 33.6 MB). Free memory was 59.2 MB in the beginning and 83.3 MB in the end (delta: -24.0 MB). Peak memory consumption was 24.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 63.61 ms. Allocated memory is still 109.1 MB. Free memory was 83.3 MB in the beginning and 77.0 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 54.47 ms. Allocated memory is still 109.1 MB. Free memory was 77.0 MB in the beginning and 71.6 MB in the end (delta: 5.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2500.94 ms. Allocated memory is still 109.1 MB. Free memory was 71.6 MB in the beginning and 72.5 MB in the end (delta: -828.6 kB). Peak memory consumption was 39.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 694813.47 ms. Allocated memory was 109.1 MB in the beginning and 604.0 MB in the end (delta: 494.9 MB). Free memory was 72.5 MB in the beginning and 398.0 MB in the end (delta: -325.6 MB). Peak memory consumption was 513.7 MB. Max. memory is 16.1 GB. * Witness Printer took 354.37 ms. Allocated memory is still 604.0 MB. Free memory was 398.0 MB in the beginning and 226.2 MB in the end (delta: 171.9 MB). Peak memory consumption was 169.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 86]: 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 FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==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] [L369] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && 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] [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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, 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=37, a15=9, a21=8, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND TRUE ( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9))) [L426] a15 = 5 [L427] a21 = 10 [L429] return -1; VAL [a12=37, a15=5, 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=37, a15=5, 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=37, a15=5, 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=37, a15=5, 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=37, a15=5, 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=37, a15=5, 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=37, a15=5, 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=37, a15=5, 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=37, a15=5, 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=37, a15=5, 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=37, a15=5, 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=37, a15=5, 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=37, a15=5, 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=37, a15=5, 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=37, a15=5, 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=37, a15=5, 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=37, a15=5, 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=37, a15=5, 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=37, a15=5, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND TRUE ((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10)) VAL [a12=37, a15=5, a21=10, a24=1, inputA=1, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] reach_error() VAL [a12=37, a15=5, a21=10, 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: 694.3s, OverallIterations: 19, TraceHistogramMax: 13, AutomataDifference: 526.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2135 SDtfs, 12340 SDslu, 840 SDs, 0 SdLazy, 42562 SolverSat, 2572 SolverUnsat, 102 SolverUnknown, 0 SolverNotchecked, 462.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41298 GetRequests, 40795 SyntacticMatches, 197 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2675 ImplicationChecksByTransitivity, 91.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5846occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 5467 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 7.1s SatisfiabilityAnalysisTime, 150.1s InterpolantComputationTime, 25030 NumberOfCodeBlocks, 25030 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 41214 ConstructedInterpolants, 0 QuantifiedInterpolants, 347974924 SizeOfPredicates, 140 NumberOfNonLiveVariables, 26490 ConjunctsInSsa, 262 ConjunctsInUnsatCore, 55 InterpolantComputations, 14 PerfectInterpolantSequences, 87723/110354 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...