./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label33.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d8da42f3-2fdf-4a49-8b63-cb66d76f7920/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d8da42f3-2fdf-4a49-8b63-cb66d76f7920/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d8da42f3-2fdf-4a49-8b63-cb66d76f7920/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d8da42f3-2fdf-4a49-8b63-cb66d76f7920/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label33.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d8da42f3-2fdf-4a49-8b63-cb66d76f7920/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d8da42f3-2fdf-4a49-8b63-cb66d76f7920/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a503fea819b7f7110cbbc6f7f69d6be84492b6b4 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1.24-678e011 [2019-11-20 01:05:34,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:05:34,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:05:34,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:05:34,621 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:05:34,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:05:34,624 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:05:34,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:05:34,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:05:34,642 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:05:34,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:05:34,645 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:05:34,645 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:05:34,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:05:34,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:05:34,650 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:05:34,651 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:05:34,652 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:05:34,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:05:34,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:05:34,662 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:05:34,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:05:34,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:05:34,668 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:05:34,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:05:34,671 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:05:34,671 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:05:34,672 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:05:34,673 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:05:34,674 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:05:34,674 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:05:34,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:05:34,675 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:05:34,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:05:34,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:05:34,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:05:34,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:05:34,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:05:34,679 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:05:34,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:05:34,681 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:05:34,681 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d8da42f3-2fdf-4a49-8b63-cb66d76f7920/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-11-20 01:05:34,708 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:05:34,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:05:34,719 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-20 01:05:34,719 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-11-20 01:05:34,720 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:05:34,720 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:05:34,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:05:34,721 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:05:34,721 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 01:05:34,721 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:05:34,721 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:05:34,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 01:05:34,722 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 01:05:34,722 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 01:05:34,722 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:05:34,722 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 01:05:34,722 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:05:34,723 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 01:05:34,723 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-11-20 01:05:34,723 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-11-20 01:05:34,723 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:05:34,724 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 01:05:34,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 01:05:34,724 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:05:34,724 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 01:05:34,725 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 01:05:34,725 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-11-20 01:05:34,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 01:05:34,726 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 01:05:34,727 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_d8da42f3-2fdf-4a49-8b63-cb66d76f7920/bin/ukojak 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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak 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 -> a503fea819b7f7110cbbc6f7f69d6be84492b6b4 [2019-11-20 01:05:34,900 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:05:34,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:05:34,917 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:05:34,919 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:05:34,919 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:05:34,920 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d8da42f3-2fdf-4a49-8b63-cb66d76f7920/bin/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label33.c [2019-11-20 01:05:34,982 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d8da42f3-2fdf-4a49-8b63-cb66d76f7920/bin/ukojak/data/9380725ca/b871562748484b2abca4ac86598d746c/FLAG9a241aa15 [2019-11-20 01:05:35,462 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:05:35,462 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d8da42f3-2fdf-4a49-8b63-cb66d76f7920/sv-benchmarks/c/eca-rers2012/Problem01_label33.c [2019-11-20 01:05:35,476 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d8da42f3-2fdf-4a49-8b63-cb66d76f7920/bin/ukojak/data/9380725ca/b871562748484b2abca4ac86598d746c/FLAG9a241aa15 [2019-11-20 01:05:35,785 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d8da42f3-2fdf-4a49-8b63-cb66d76f7920/bin/ukojak/data/9380725ca/b871562748484b2abca4ac86598d746c [2019-11-20 01:05:35,787 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:05:35,788 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 01:05:35,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:05:35,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:05:35,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:05:35,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:05:35" (1/1) ... [2019-11-20 01:05:35,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d9c4f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:05:35, skipping insertion in model container [2019-11-20 01:05:35,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:05:35" (1/1) ... [2019-11-20 01:05:35,805 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:05:35,867 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:05:36,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:05:36,344 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:05:36,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:05:36,469 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:05:36,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:05:36 WrapperNode [2019-11-20 01:05:36,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:05:36,470 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 01:05:36,470 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 01:05:36,471 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 01:05:36,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:05:36" (1/1) ... [2019-11-20 01:05:36,513 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:05:36" (1/1) ... [2019-11-20 01:05:36,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 01:05:36,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:05:36,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:05:36,561 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:05:36,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:05:36" (1/1) ... [2019-11-20 01:05:36,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:05:36" (1/1) ... [2019-11-20 01:05:36,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:05:36" (1/1) ... [2019-11-20 01:05:36,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:05:36" (1/1) ... [2019-11-20 01:05:36,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:05:36" (1/1) ... [2019-11-20 01:05:36,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:05:36" (1/1) ... [2019-11-20 01:05:36,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:05:36" (1/1) ... [2019-11-20 01:05:36,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:05:36,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:05:36,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:05:36,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:05:36,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:05:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d8da42f3-2fdf-4a49-8b63-cb66d76f7920/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2019-11-20 01:05:36,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:05:36,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:05:38,635 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:05:38,636 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 01:05:38,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:05:38 BoogieIcfgContainer [2019-11-20 01:05:38,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:05:38,638 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-11-20 01:05:38,638 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-11-20 01:05:38,648 INFO L275 PluginConnector]: CodeCheck initialized [2019-11-20 01:05:38,650 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:05:38" (1/1) ... [2019-11-20 01:05:38,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:05:38,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2019-11-20 01:05:38,697 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2019-11-20 01:05:38,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-20 01:05:38,703 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:39,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:05:39,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:39,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 145 states and 237 transitions. [2019-11-20 01:05:39,764 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 237 transitions. [2019-11-20 01:05:39,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 01:05:39,767 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:39,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:05:40,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:40,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 146 states and 238 transitions. [2019-11-20 01:05:40,147 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 238 transitions. [2019-11-20 01:05:40,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-20 01:05:40,149 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:05:40,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:40,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 150 states and 245 transitions. [2019-11-20 01:05:40,343 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 245 transitions. [2019-11-20 01:05:40,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 01:05:40,346 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:40,378 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:05:40,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:40,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 151 states and 246 transitions. [2019-11-20 01:05:40,516 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 246 transitions. [2019-11-20 01:05:40,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 01:05:40,518 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:40,583 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:05:40,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:40,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 159 states and 261 transitions. [2019-11-20 01:05:40,910 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 261 transitions. [2019-11-20 01:05:40,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 01:05:40,912 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:05:41,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 170 states and 280 transitions. [2019-11-20 01:05:41,596 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 280 transitions. [2019-11-20 01:05:41,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 01:05:41,600 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:05:41,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:41,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 171 states and 281 transitions. [2019-11-20 01:05:41,710 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 281 transitions. [2019-11-20 01:05:41,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 01:05:41,717 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:05:41,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:41,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 177 states and 288 transitions. [2019-11-20 01:05:41,964 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 288 transitions. [2019-11-20 01:05:41,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 01:05:41,965 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:42,094 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:05:42,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:42,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 191 states and 307 transitions. [2019-11-20 01:05:42,831 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 307 transitions. [2019-11-20 01:05:42,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 01:05:42,832 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:42,893 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:05:43,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:43,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 200 states and 325 transitions. [2019-11-20 01:05:43,546 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 325 transitions. [2019-11-20 01:05:43,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 01:05:43,549 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:43,584 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:05:43,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 201 states and 327 transitions. [2019-11-20 01:05:43,746 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 327 transitions. [2019-11-20 01:05:43,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 01:05:43,747 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:43,780 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:05:43,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:43,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 202 states and 329 transitions. [2019-11-20 01:05:43,808 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 329 transitions. [2019-11-20 01:05:43,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 01:05:43,809 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:43,853 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:05:43,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:43,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 203 states and 330 transitions. [2019-11-20 01:05:43,927 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 330 transitions. [2019-11-20 01:05:43,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 01:05:43,929 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:44,020 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:05:44,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:44,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 214 states and 347 transitions. [2019-11-20 01:05:44,936 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 347 transitions. [2019-11-20 01:05:44,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 01:05:44,938 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:44,968 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:05:45,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:45,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 217 states and 350 transitions. [2019-11-20 01:05:45,040 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 350 transitions. [2019-11-20 01:05:45,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 01:05:45,041 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:45,065 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:05:45,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:45,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 219 states and 351 transitions. [2019-11-20 01:05:45,232 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 351 transitions. [2019-11-20 01:05:45,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 01:05:45,233 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:45,261 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 01:05:45,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:45,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 223 states and 355 transitions. [2019-11-20 01:05:45,448 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 355 transitions. [2019-11-20 01:05:45,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 01:05:45,449 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:45,484 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 01:05:45,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:45,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 224 states and 356 transitions. [2019-11-20 01:05:45,691 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 356 transitions. [2019-11-20 01:05:45,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-20 01:05:45,693 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:45,782 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:05:46,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:46,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 230 states and 366 transitions. [2019-11-20 01:05:46,183 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 366 transitions. [2019-11-20 01:05:46,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-20 01:05:46,184 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:46,210 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:05:47,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:47,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 241 states and 381 transitions. [2019-11-20 01:05:47,407 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 381 transitions. [2019-11-20 01:05:47,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-20 01:05:47,408 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 01:05:47,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:47,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 243 states and 382 transitions. [2019-11-20 01:05:47,662 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 382 transitions. [2019-11-20 01:05:47,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 01:05:47,664 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:47,693 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:05:48,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:48,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 254 states and 392 transitions. [2019-11-20 01:05:48,308 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 392 transitions. [2019-11-20 01:05:48,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 01:05:48,310 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:48,426 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:05:49,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:49,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 278 states and 426 transitions. [2019-11-20 01:05:49,607 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 426 transitions. [2019-11-20 01:05:49,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 01:05:49,608 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 01:05:49,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 280 states and 431 transitions. [2019-11-20 01:05:49,801 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 431 transitions. [2019-11-20 01:05:49,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 01:05:49,802 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:49,884 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:05:49,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:49,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 283 states and 434 transitions. [2019-11-20 01:05:49,923 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 434 transitions. [2019-11-20 01:05:49,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 01:05:49,924 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:50,006 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:05:50,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:50,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 298 states and 451 transitions. [2019-11-20 01:05:50,621 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 451 transitions. [2019-11-20 01:05:50,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 01:05:50,622 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:50,698 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:05:50,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 301 states and 454 transitions. [2019-11-20 01:05:50,900 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 454 transitions. [2019-11-20 01:05:50,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 01:05:50,902 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:51,039 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:05:53,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 326 states and 489 transitions. [2019-11-20 01:05:53,250 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 489 transitions. [2019-11-20 01:05:53,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 01:05:53,251 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:53,388 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:05:54,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:54,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 337 states and 501 transitions. [2019-11-20 01:05:54,845 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 501 transitions. [2019-11-20 01:05:54,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 01:05:54,847 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:55,584 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:05:58,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:58,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 362 states and 544 transitions. [2019-11-20 01:05:58,390 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 544 transitions. [2019-11-20 01:05:58,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 01:05:58,392 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:05:58,613 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:05:59,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:05:59,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 378 states and 566 transitions. [2019-11-20 01:05:59,890 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 566 transitions. [2019-11-20 01:05:59,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 01:05:59,891 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:05:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:00,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 384 states and 573 transitions. [2019-11-20 01:06:00,870 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 573 transitions. [2019-11-20 01:06:00,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 01:06:00,871 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:01,116 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:01,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:01,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 390 states and 579 transitions. [2019-11-20 01:06:01,543 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 579 transitions. [2019-11-20 01:06:01,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 01:06:01,544 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:01,813 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:02,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:02,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 391 states and 580 transitions. [2019-11-20 01:06:02,325 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 580 transitions. [2019-11-20 01:06:02,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 01:06:02,329 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:02,370 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:02,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:02,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 393 states and 583 transitions. [2019-11-20 01:06:02,460 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 583 transitions. [2019-11-20 01:06:02,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 01:06:02,461 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:03,002 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:04,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:04,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 407 states and 605 transitions. [2019-11-20 01:06:04,848 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 605 transitions. [2019-11-20 01:06:04,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 01:06:04,849 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:04,890 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:05,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:05,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 418 states and 617 transitions. [2019-11-20 01:06:05,884 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 617 transitions. [2019-11-20 01:06:05,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-20 01:06:05,885 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:05,918 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:06:07,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:07,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 429 states and 630 transitions. [2019-11-20 01:06:07,181 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 630 transitions. [2019-11-20 01:06:07,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 01:06:07,182 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 01:06:08,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 438 states and 641 transitions. [2019-11-20 01:06:08,457 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 641 transitions. [2019-11-20 01:06:08,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 01:06:08,458 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:08,493 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:11,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:11,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 466 states and 675 transitions. [2019-11-20 01:06:11,253 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 675 transitions. [2019-11-20 01:06:11,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 01:06:11,253 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:11,309 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:12,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 479 states and 694 transitions. [2019-11-20 01:06:12,800 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 694 transitions. [2019-11-20 01:06:12,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 01:06:12,801 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:14,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:14,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 497 states and 717 transitions. [2019-11-20 01:06:14,045 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 717 transitions. [2019-11-20 01:06:14,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 01:06:14,046 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:14,091 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:14,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:14,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 501 states and 721 transitions. [2019-11-20 01:06:14,428 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 721 transitions. [2019-11-20 01:06:14,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-20 01:06:14,482 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:14,716 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:15,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:15,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 510 states and 729 transitions. [2019-11-20 01:06:15,845 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 729 transitions. [2019-11-20 01:06:15,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-20 01:06:15,846 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:15,920 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:16,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:16,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 580 states and 814 transitions. [2019-11-20 01:06:16,656 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 814 transitions. [2019-11-20 01:06:16,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 01:06:16,656 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:17,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:17,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 589 states and 827 transitions. [2019-11-20 01:06:17,665 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 827 transitions. [2019-11-20 01:06:17,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 01:06:17,665 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:17,689 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:18,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:18,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 591 states and 827 transitions. [2019-11-20 01:06:18,026 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 827 transitions. [2019-11-20 01:06:18,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 01:06:18,027 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:18,056 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:18,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:18,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 601 states and 837 transitions. [2019-11-20 01:06:18,404 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 837 transitions. [2019-11-20 01:06:18,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 01:06:18,404 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:18,470 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:18,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:18,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 610 states and 849 transitions. [2019-11-20 01:06:18,519 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 849 transitions. [2019-11-20 01:06:18,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-20 01:06:18,520 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:18,591 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:18,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:18,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 623 states and 864 transitions. [2019-11-20 01:06:18,951 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 864 transitions. [2019-11-20 01:06:18,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-20 01:06:18,952 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:18,980 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 01:06:19,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:19,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 625 states and 865 transitions. [2019-11-20 01:06:19,113 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 865 transitions. [2019-11-20 01:06:19,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 01:06:19,114 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:19,213 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:19,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:19,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 629 states and 868 transitions. [2019-11-20 01:06:19,481 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 868 transitions. [2019-11-20 01:06:19,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 01:06:19,482 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:19,511 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 01:06:19,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:19,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 631 states and 869 transitions. [2019-11-20 01:06:19,742 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 869 transitions. [2019-11-20 01:06:19,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 01:06:19,743 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 645 states and 885 transitions. [2019-11-20 01:06:20,288 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 885 transitions. [2019-11-20 01:06:20,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 01:06:20,289 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:20,322 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 01:06:20,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:20,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 647 states and 888 transitions. [2019-11-20 01:06:20,353 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 888 transitions. [2019-11-20 01:06:20,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 01:06:20,354 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:20,826 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:23,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 692 states and 937 transitions. [2019-11-20 01:06:23,916 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 937 transitions. [2019-11-20 01:06:23,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 01:06:23,917 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:23,995 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 01:06:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:24,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 767 states and 1015 transitions. [2019-11-20 01:06:24,931 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1015 transitions. [2019-11-20 01:06:24,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-20 01:06:24,932 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:24,959 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 01:06:25,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:25,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 771 states and 1021 transitions. [2019-11-20 01:06:25,292 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1021 transitions. [2019-11-20 01:06:25,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-20 01:06:25,293 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:25,326 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 01:06:26,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 778 states and 1026 transitions. [2019-11-20 01:06:26,086 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1026 transitions. [2019-11-20 01:06:26,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-20 01:06:26,087 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:26,125 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 57 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-20 01:06:26,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:26,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 799 states and 1052 transitions. [2019-11-20 01:06:26,907 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1052 transitions. [2019-11-20 01:06:26,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-20 01:06:26,908 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:26,950 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-20 01:06:27,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:27,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 802 states and 1055 transitions. [2019-11-20 01:06:27,161 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1055 transitions. [2019-11-20 01:06:27,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-20 01:06:27,163 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:27,418 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 01:06:28,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:28,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 813 states and 1073 transitions. [2019-11-20 01:06:28,161 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1073 transitions. [2019-11-20 01:06:28,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-20 01:06:28,163 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:28,623 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 01:06:29,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:29,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 828 states and 1098 transitions. [2019-11-20 01:06:29,773 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1098 transitions. [2019-11-20 01:06:29,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-20 01:06:29,774 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 94 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:32,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 858 states and 1132 transitions. [2019-11-20 01:06:32,132 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1132 transitions. [2019-11-20 01:06:32,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-20 01:06:32,133 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:32,222 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 01:06:32,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:32,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 860 states and 1135 transitions. [2019-11-20 01:06:32,599 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1135 transitions. [2019-11-20 01:06:32,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-20 01:06:32,600 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:32,649 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 01:06:36,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:36,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 892 states and 1179 transitions. [2019-11-20 01:06:36,319 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1179 transitions. [2019-11-20 01:06:36,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-20 01:06:36,320 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:36,390 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 01:06:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:37,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 907 states and 1193 transitions. [2019-11-20 01:06:37,520 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1193 transitions. [2019-11-20 01:06:37,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-20 01:06:37,524 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:37,575 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 01:06:37,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:37,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 908 states and 1194 transitions. [2019-11-20 01:06:37,818 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1194 transitions. [2019-11-20 01:06:37,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-20 01:06:37,819 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:38,458 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:40,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:40,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 933 states and 1221 transitions. [2019-11-20 01:06:40,339 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1221 transitions. [2019-11-20 01:06:40,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-20 01:06:40,340 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:40,386 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 70 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 01:06:41,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:41,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 963 states and 1255 transitions. [2019-11-20 01:06:41,510 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1255 transitions. [2019-11-20 01:06:41,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-20 01:06:41,511 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:41,546 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 01:06:41,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:41,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 970 states and 1263 transitions. [2019-11-20 01:06:41,964 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1263 transitions. [2019-11-20 01:06:41,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-20 01:06:41,966 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:42,000 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 01:06:43,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:43,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 975 states and 1271 transitions. [2019-11-20 01:06:43,352 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1271 transitions. [2019-11-20 01:06:43,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-20 01:06:43,353 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:44,673 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1032 states and 1332 transitions. [2019-11-20 01:06:50,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1332 transitions. [2019-11-20 01:06:50,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-20 01:06:50,542 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:55,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:55,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1090 states and 1394 transitions. [2019-11-20 01:06:55,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1394 transitions. [2019-11-20 01:06:55,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-20 01:06:55,255 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:55,377 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:56,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:56,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1101 states and 1405 transitions. [2019-11-20 01:06:56,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1405 transitions. [2019-11-20 01:06:56,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 01:06:56,146 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:56,210 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-11-20 01:06:56,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1102 states and 1405 transitions. [2019-11-20 01:06:56,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1405 transitions. [2019-11-20 01:06:56,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-20 01:06:56,288 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:56,357 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:06:59,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:06:59,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1143 states and 1451 transitions. [2019-11-20 01:06:59,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1451 transitions. [2019-11-20 01:06:59,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-20 01:06:59,621 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:06:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:06:59,668 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:07:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:00,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1146 states and 1456 transitions. [2019-11-20 01:07:00,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1456 transitions. [2019-11-20 01:07:00,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-20 01:07:00,569 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:00,634 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:07:01,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:01,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1150 states and 1459 transitions. [2019-11-20 01:07:01,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1459 transitions. [2019-11-20 01:07:01,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-20 01:07:01,141 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:01,198 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:07:02,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:02,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1154 states and 1464 transitions. [2019-11-20 01:07:02,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1464 transitions. [2019-11-20 01:07:02,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-20 01:07:02,401 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:02,850 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 106 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 01:07:03,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:03,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1159 states and 1473 transitions. [2019-11-20 01:07:03,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1473 transitions. [2019-11-20 01:07:03,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 01:07:03,801 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:03,866 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:07:04,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1170 states and 1485 transitions. [2019-11-20 01:07:04,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1485 transitions. [2019-11-20 01:07:04,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-20 01:07:04,242 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:04,447 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 01:07:05,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:05,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1174 states and 1491 transitions. [2019-11-20 01:07:05,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1491 transitions. [2019-11-20 01:07:05,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-20 01:07:05,013 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:05,073 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 01:07:07,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:07,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1204 states and 1531 transitions. [2019-11-20 01:07:07,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1531 transitions. [2019-11-20 01:07:07,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-20 01:07:07,736 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:07,786 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 01:07:08,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:08,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1206 states and 1533 transitions. [2019-11-20 01:07:08,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1533 transitions. [2019-11-20 01:07:08,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-20 01:07:08,136 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:08,556 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-20 01:07:09,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1216 states and 1547 transitions. [2019-11-20 01:07:09,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1547 transitions. [2019-11-20 01:07:09,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-20 01:07:09,581 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:10,995 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 161 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:07:15,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1246 states and 1584 transitions. [2019-11-20 01:07:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 1584 transitions. [2019-11-20 01:07:15,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-20 01:07:15,254 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:15,357 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-20 01:07:16,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:16,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1255 states and 1595 transitions. [2019-11-20 01:07:16,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1595 transitions. [2019-11-20 01:07:16,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-11-20 01:07:16,073 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:16,174 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-20 01:07:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:16,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1256 states and 1595 transitions. [2019-11-20 01:07:16,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1595 transitions. [2019-11-20 01:07:16,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-20 01:07:16,868 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:16,980 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-20 01:07:17,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:17,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1258 states and 1598 transitions. [2019-11-20 01:07:17,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1598 transitions. [2019-11-20 01:07:17,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-20 01:07:17,433 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:17,624 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-20 01:07:18,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:18,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1269 states and 1608 transitions. [2019-11-20 01:07:18,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1608 transitions. [2019-11-20 01:07:18,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-20 01:07:18,501 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:18,794 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-20 01:07:20,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:20,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1289 states and 1633 transitions. [2019-11-20 01:07:20,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1633 transitions. [2019-11-20 01:07:20,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-11-20 01:07:20,178 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:20,244 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:07:21,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:21,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1315 states and 1662 transitions. [2019-11-20 01:07:21,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1662 transitions. [2019-11-20 01:07:21,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-20 01:07:21,841 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:21,906 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 01:07:21,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1322 states and 1669 transitions. [2019-11-20 01:07:21,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1669 transitions. [2019-11-20 01:07:21,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-20 01:07:21,968 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:22,629 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 171 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:07:25,316 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-11-20 01:07:26,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:26,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1363 states and 1715 transitions. [2019-11-20 01:07:26,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1715 transitions. [2019-11-20 01:07:26,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-20 01:07:26,018 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:26,165 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 171 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:07:27,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:27,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1374 states and 1729 transitions. [2019-11-20 01:07:27,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1729 transitions. [2019-11-20 01:07:27,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-20 01:07:27,717 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 01:07:30,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:30,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1417 states and 1777 transitions. [2019-11-20 01:07:30,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1777 transitions. [2019-11-20 01:07:30,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-20 01:07:30,622 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:30,957 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 01:07:33,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:33,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1427 states and 1788 transitions. [2019-11-20 01:07:33,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1788 transitions. [2019-11-20 01:07:33,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-20 01:07:33,485 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:33,785 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 113 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 01:07:34,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:34,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1432 states and 1793 transitions. [2019-11-20 01:07:34,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1793 transitions. [2019-11-20 01:07:34,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-20 01:07:34,313 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:34,388 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 01:07:35,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:35,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1442 states and 1802 transitions. [2019-11-20 01:07:35,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 1802 transitions. [2019-11-20 01:07:35,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-20 01:07:35,488 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:35,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:36,437 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 109 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:07:39,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:39,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1482 states and 1846 transitions. [2019-11-20 01:07:39,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1846 transitions. [2019-11-20 01:07:39,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 01:07:39,345 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:39,417 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 01:07:41,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:41,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1502 states and 1867 transitions. [2019-11-20 01:07:41,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1867 transitions. [2019-11-20 01:07:41,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 01:07:41,170 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:41,405 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 01:07:42,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:42,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1523 states and 1894 transitions. [2019-11-20 01:07:42,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1894 transitions. [2019-11-20 01:07:42,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 01:07:42,686 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:44,616 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 01:07:48,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:48,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1571 states and 1942 transitions. [2019-11-20 01:07:48,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 1942 transitions. [2019-11-20 01:07:48,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-20 01:07:48,757 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:49,108 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-20 01:07:50,214 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-11-20 01:07:52,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:52,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1601 states and 1983 transitions. [2019-11-20 01:07:52,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 1983 transitions. [2019-11-20 01:07:52,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-20 01:07:52,067 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:52,124 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-20 01:07:52,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:52,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1604 states and 1989 transitions. [2019-11-20 01:07:52,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 1989 transitions. [2019-11-20 01:07:52,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-20 01:07:52,980 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:53,044 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-20 01:07:54,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:54,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1609 states and 1994 transitions. [2019-11-20 01:07:54,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 1994 transitions. [2019-11-20 01:07:54,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-20 01:07:54,084 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-11-20 01:07:54,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:54,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 1616 states and 2002 transitions. [2019-11-20 01:07:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2002 transitions. [2019-11-20 01:07:54,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-20 01:07:54,461 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:54,504 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-20 01:07:54,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:54,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 1642 states and 2026 transitions. [2019-11-20 01:07:54,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2026 transitions. [2019-11-20 01:07:54,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-20 01:07:54,858 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:55,190 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 233 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-20 01:07:55,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:55,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2031 states to 1646 states and 2031 transitions. [2019-11-20 01:07:55,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2031 transitions. [2019-11-20 01:07:55,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-20 01:07:55,741 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:55,794 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-20 01:07:56,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:56,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 1650 states and 2036 transitions. [2019-11-20 01:07:56,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2036 transitions. [2019-11-20 01:07:56,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-20 01:07:56,698 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:56,819 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-20 01:07:58,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:58,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 1670 states and 2060 transitions. [2019-11-20 01:07:58,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2060 transitions. [2019-11-20 01:07:58,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-20 01:07:58,369 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:07:58,455 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-20 01:07:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:07:59,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 1680 states and 2069 transitions. [2019-11-20 01:07:59,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2069 transitions. [2019-11-20 01:07:59,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-20 01:07:59,630 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:07:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:00,886 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 237 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:08:02,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:08:02,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 1684 states and 2074 transitions. [2019-11-20 01:08:02,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2074 transitions. [2019-11-20 01:08:02,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-20 01:08:02,179 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:08:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:04,745 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 01:08:09,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:08:09,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 1744 states and 2134 transitions. [2019-11-20 01:08:09,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2134 transitions. [2019-11-20 01:08:09,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-20 01:08:09,403 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:08:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:08:14,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:08:14,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 1748 states and 2140 transitions. [2019-11-20 01:08:14,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2140 transitions. [2019-11-20 01:08:14,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-20 01:08:14,017 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:08:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:14,306 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-11-20 01:08:15,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:08:15,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 1818 states and 2215 transitions. [2019-11-20 01:08:15,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2215 transitions. [2019-11-20 01:08:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-20 01:08:15,715 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:08:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:15,822 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 116 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-20 01:08:17,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:08:17,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 1827 states and 2240 transitions. [2019-11-20 01:08:17,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2240 transitions. [2019-11-20 01:08:17,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-20 01:08:17,299 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:08:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:17,372 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 116 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-20 01:08:23,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:08:23,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 1893 states and 2315 transitions. [2019-11-20 01:08:23,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2315 transitions. [2019-11-20 01:08:23,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-20 01:08:23,478 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:08:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:23,549 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 116 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-20 01:08:27,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:08:27,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 1933 states and 2357 transitions. [2019-11-20 01:08:27,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2357 transitions. [2019-11-20 01:08:27,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-20 01:08:27,604 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:08:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:27,687 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 116 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-20 01:08:28,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:08:28,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 1934 states and 2357 transitions. [2019-11-20 01:08:28,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 2357 transitions. [2019-11-20 01:08:28,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-20 01:08:28,352 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:08:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:28,750 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 171 proven. 78 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 01:08:30,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:08:30,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 1944 states and 2372 transitions. [2019-11-20 01:08:30,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1944 states and 2372 transitions. [2019-11-20 01:08:30,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-20 01:08:30,874 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:08:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:31,066 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 171 proven. 78 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-20 01:08:33,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:08:33,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 1968 states and 2400 transitions. [2019-11-20 01:08:33,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 2400 transitions. [2019-11-20 01:08:33,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-20 01:08:33,206 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:08:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:33,303 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-20 01:08:34,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:08:34,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 1973 states and 2406 transitions. [2019-11-20 01:08:34,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1973 states and 2406 transitions. [2019-11-20 01:08:34,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-20 01:08:34,546 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:08:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:34,651 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-20 01:08:35,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:08:35,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 1974 states and 2408 transitions. [2019-11-20 01:08:35,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 2408 transitions. [2019-11-20 01:08:35,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-20 01:08:35,370 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:08:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:35,544 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 159 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-20 01:08:35,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:08:35,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 1976 states and 2412 transitions. [2019-11-20 01:08:35,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 2412 transitions. [2019-11-20 01:08:35,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-20 01:08:35,950 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:08:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:36,198 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 159 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-20 01:08:38,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:08:38,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2439 states to 1996 states and 2439 transitions. [2019-11-20 01:08:38,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 2439 transitions. [2019-11-20 01:08:38,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-20 01:08:38,406 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:08:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 159 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-20 01:08:40,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:08:40,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2012 states and 2457 transitions. [2019-11-20 01:08:40,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2457 transitions. [2019-11-20 01:08:40,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-20 01:08:40,699 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:08:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:40,905 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 159 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-20 01:08:42,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:08:42,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2014 states and 2457 transitions. [2019-11-20 01:08:42,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 2457 transitions. [2019-11-20 01:08:42,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-20 01:08:42,083 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:08:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:42,285 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 159 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-20 01:08:45,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:08:45,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2046 states and 2493 transitions. [2019-11-20 01:08:45,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 2493 transitions. [2019-11-20 01:08:45,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-20 01:08:45,625 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:08:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:45,810 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 159 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-20 01:08:46,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:08:46,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2047 states and 2493 transitions. [2019-11-20 01:08:46,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 2493 transitions. [2019-11-20 01:08:46,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-11-20 01:08:46,435 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:08:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 159 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-20 01:08:47,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:08:47,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2048 states and 2493 transitions. [2019-11-20 01:08:47,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2493 transitions. [2019-11-20 01:08:47,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-20 01:08:47,241 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:08:47,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:49,561 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-20 01:08:54,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:08:54,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2073 states and 2520 transitions. [2019-11-20 01:08:54,656 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 2520 transitions. [2019-11-20 01:08:54,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-20 01:08:54,657 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:08:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:54,761 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 171 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-11-20 01:08:55,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:08:55,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2080 states and 2530 transitions. [2019-11-20 01:08:55,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2080 states and 2530 transitions. [2019-11-20 01:08:55,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-20 01:08:55,866 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:08:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:08:55,972 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 171 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-11-20 01:09:00,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:09:00,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2106 states and 2558 transitions. [2019-11-20 01:09:00,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 2558 transitions. [2019-11-20 01:09:00,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-20 01:09:00,099 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:09:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:09:00,195 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 171 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-11-20 01:09:01,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:09:01,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2117 states and 2568 transitions. [2019-11-20 01:09:01,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 2568 transitions. [2019-11-20 01:09:01,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-20 01:09:01,469 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:09:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:09:04,114 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 01:09:11,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:09:11,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2622 states to 2169 states and 2622 transitions. [2019-11-20 01:09:11,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 2622 transitions. [2019-11-20 01:09:11,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-20 01:09:11,388 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:09:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:09:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 229 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 01:09:14,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 01:09:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2175 states and 2627 transitions. [2019-11-20 01:09:14,648 INFO L276 IsEmpty]: Start isEmpty. Operand 2175 states and 2627 transitions. [2019-11-20 01:09:14,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-20 01:09:14,649 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 01:09:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:09:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:09:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:09:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:09:15,016 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 139 iterations. [2019-11-20 01:09:15,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 20.11 01:09:15 ImpRootNode [2019-11-20 01:09:15,252 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-11-20 01:09:15,252 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 01:09:15,252 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 01:09:15,253 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 01:09:15,253 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:05:38" (3/4) ... [2019-11-20 01:09:15,255 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 01:09:15,446 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d8da42f3-2fdf-4a49-8b63-cb66d76f7920/bin/ukojak/witness.graphml [2019-11-20 01:09:15,446 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 01:09:15,447 INFO L168 Benchmark]: Toolchain (without parser) took 219659.11 ms. Allocated memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: 3.0 GB). Free memory was 946.1 MB in the beginning and 1.3 GB in the end (delta: -339.3 MB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2019-11-20 01:09:15,448 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:09:15,448 INFO L168 Benchmark]: CACSL2BoogieTranslator took 680.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-11-20 01:09:15,449 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:09:15,449 INFO L168 Benchmark]: Boogie Preprocessor took 53.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-20 01:09:15,449 INFO L168 Benchmark]: RCFGBuilder took 2023.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 869.2 MB in the end (delta: 219.0 MB). Peak memory consumption was 219.0 MB. Max. memory is 11.5 GB. [2019-11-20 01:09:15,450 INFO L168 Benchmark]: CodeCheck took 216614.22 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.9 GB). Free memory was 869.2 MB in the beginning and 1.3 GB in the end (delta: -435.6 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2019-11-20 01:09:15,450 INFO L168 Benchmark]: Witness Printer took 193.92 ms. Allocated memory is still 4.0 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2019-11-20 01:09:15,452 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: UNSAFE, OverallTime: 216.3s, OverallIterations: 139, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1979719736 SDtfs, -228184214 SDslu, -486489976 SDs, 0 SdLazy, 1881044944 SolverSat, 1652032194 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 636.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138379 GetRequests, 133596 SyntacticMatches, 3245 SemanticMatches, 1538 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1757373 ImplicationChecksByTransitivity, 192.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.6s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 30.9s InterpolantComputationTime, 19918 NumberOfCodeBlocks, 19918 NumberOfCodeBlocksAsserted, 139 NumberOfCheckSat, 19567 ConstructedInterpolants, 0 QuantifiedInterpolants, 12864144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 138 InterpolantComputations, 108 PerfectInterpolantSequences, 14576/14993 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 407]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND TRUE (((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1)) [L103] a20 = 0 [L104] a8 = 15 [L105] a17 = 0 [L106] a21 = 1 [L107] return -1; VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L406] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] __VERIFIER_error() VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 680.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 89.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2023.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 869.2 MB in the end (delta: 219.0 MB). Peak memory consumption was 219.0 MB. Max. memory is 11.5 GB. * CodeCheck took 216614.22 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.9 GB). Free memory was 869.2 MB in the beginning and 1.3 GB in the end (delta: -435.6 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 193.92 ms. Allocated memory is still 4.0 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...