./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label38.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_545a4b02-7d03-4f45-9784-95558e5a3197/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_545a4b02-7d03-4f45-9784-95558e5a3197/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_545a4b02-7d03-4f45-9784-95558e5a3197/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_545a4b02-7d03-4f45-9784-95558e5a3197/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label38.c -s /tmp/vcloud-vcloud-master/worker/run_dir_545a4b02-7d03-4f45-9784-95558e5a3197/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_545a4b02-7d03-4f45-9784-95558e5a3197/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 5d9bfdaf23db32516d1ccf8929c6af5e4a9d3bd0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 00:43:19,815 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:43:19,817 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:43:19,829 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:43:19,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:43:19,830 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:43:19,832 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:43:19,833 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:43:19,835 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:43:19,836 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:43:19,837 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:43:19,838 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:43:19,838 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:43:19,839 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:43:19,840 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:43:19,841 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:43:19,842 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:43:19,842 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:43:19,845 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:43:19,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:43:19,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:43:19,850 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:43:19,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:43:19,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:43:19,857 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:43:19,857 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:43:19,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:43:19,858 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:43:19,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:43:19,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:43:19,859 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:43:19,860 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:43:19,861 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:43:19,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:43:19,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:43:19,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:43:19,863 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:43:19,863 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:43:19,863 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:43:19,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:43:19,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:43:19,865 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_545a4b02-7d03-4f45-9784-95558e5a3197/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-11-20 00:43:19,889 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:43:19,889 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:43:19,890 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-20 00:43:19,890 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-11-20 00:43:19,891 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:43:19,891 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:43:19,891 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:43:19,891 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:43:19,892 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:43:19,892 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:43:19,893 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:43:19,893 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:43:19,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:43:19,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:43:19,894 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:43:19,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:43:19,894 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:43:19,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:43:19,894 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-11-20 00:43:19,894 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-11-20 00:43:19,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:43:19,895 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:43:19,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-11-20 00:43:19,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:43:19,895 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:43:19,896 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:43:19,896 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-11-20 00:43:19,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 00:43:19,896 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:43:19,896 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_545a4b02-7d03-4f45-9784-95558e5a3197/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 -> 5d9bfdaf23db32516d1ccf8929c6af5e4a9d3bd0 [2019-11-20 00:43:20,057 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:43:20,067 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:43:20,070 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:43:20,071 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:43:20,072 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:43:20,072 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_545a4b02-7d03-4f45-9784-95558e5a3197/bin/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label38.c [2019-11-20 00:43:20,117 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_545a4b02-7d03-4f45-9784-95558e5a3197/bin/ukojak/data/c46d43a64/2d93a493702c41de96ba72fd41d41581/FLAG7c965842c [2019-11-20 00:43:20,589 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:43:20,589 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_545a4b02-7d03-4f45-9784-95558e5a3197/sv-benchmarks/c/eca-rers2012/Problem01_label38.c [2019-11-20 00:43:20,603 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_545a4b02-7d03-4f45-9784-95558e5a3197/bin/ukojak/data/c46d43a64/2d93a493702c41de96ba72fd41d41581/FLAG7c965842c [2019-11-20 00:43:20,899 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_545a4b02-7d03-4f45-9784-95558e5a3197/bin/ukojak/data/c46d43a64/2d93a493702c41de96ba72fd41d41581 [2019-11-20 00:43:20,902 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:43:20,903 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:43:20,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:43:20,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:43:20,907 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:43:20,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:43:20" (1/1) ... [2019-11-20 00:43:20,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a153f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:43:20, skipping insertion in model container [2019-11-20 00:43:20,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:43:20" (1/1) ... [2019-11-20 00:43:20,916 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:43:20,957 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:43:21,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:43:21,355 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:43:21,458 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:43:21,473 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:43:21,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:43:21 WrapperNode [2019-11-20 00:43:21,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:43:21,474 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:43:21,474 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:43:21,474 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:43:21,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:43:21" (1/1) ... [2019-11-20 00:43:21,504 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:43:21" (1/1) ... [2019-11-20 00:43:21,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:43:21,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:43:21,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:43:21,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:43:21,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:43:21" (1/1) ... [2019-11-20 00:43:21,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:43:21" (1/1) ... [2019-11-20 00:43:21,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:43:21" (1/1) ... [2019-11-20 00:43:21,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:43:21" (1/1) ... [2019-11-20 00:43:21,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:43:21" (1/1) ... [2019-11-20 00:43:21,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:43:21" (1/1) ... [2019-11-20 00:43:21,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:43:21" (1/1) ... [2019-11-20 00:43:21,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:43:21,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:43:21,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:43:21,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:43:21,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:43:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_545a4b02-7d03-4f45-9784-95558e5a3197/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 00:43:21,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:43:21,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:43:23,721 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:43:23,722 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 00:43:23,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:43:23 BoogieIcfgContainer [2019-11-20 00:43:23,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:43:23,725 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-11-20 00:43:23,725 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-11-20 00:43:23,735 INFO L275 PluginConnector]: CodeCheck initialized [2019-11-20 00:43:23,737 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:43:23" (1/1) ... [2019-11-20 00:43:23,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:23,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:23,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2019-11-20 00:43:23,793 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2019-11-20 00:43:23,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-20 00:43:23,798 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:24,134 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 00:43:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:24,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 145 states and 239 transitions. [2019-11-20 00:43:24,673 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 239 transitions. [2019-11-20 00:43:24,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 00:43:24,676 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:24,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:43:25,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:25,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 146 states and 240 transitions. [2019-11-20 00:43:25,083 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 240 transitions. [2019-11-20 00:43:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-20 00:43:25,085 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:25,128 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 00:43:25,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:25,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 150 states and 247 transitions. [2019-11-20 00:43:25,289 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 247 transitions. [2019-11-20 00:43:25,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-20 00:43:25,291 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:25,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:43:25,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:25,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 151 states and 249 transitions. [2019-11-20 00:43:25,433 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 249 transitions. [2019-11-20 00:43:25,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-20 00:43:25,442 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:25,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:43:26,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:26,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 221 states and 323 transitions. [2019-11-20 00:43:26,355 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 323 transitions. [2019-11-20 00:43:26,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-20 00:43:26,356 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:26,422 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:43:26,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:26,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 228 states and 337 transitions. [2019-11-20 00:43:26,914 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 337 transitions. [2019-11-20 00:43:26,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 00:43:26,915 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:26,964 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 00:43:27,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:27,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 229 states and 338 transitions. [2019-11-20 00:43:27,061 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 338 transitions. [2019-11-20 00:43:27,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 00:43:27,062 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:27,093 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 00:43:27,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:27,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 232 states and 343 transitions. [2019-11-20 00:43:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 343 transitions. [2019-11-20 00:43:27,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 00:43:27,183 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:27,269 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 00:43:28,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:28,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 240 states and 359 transitions. [2019-11-20 00:43:28,049 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 359 transitions. [2019-11-20 00:43:28,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-20 00:43:28,050 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:28,105 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 00:43:28,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:28,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 245 states and 368 transitions. [2019-11-20 00:43:28,349 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 368 transitions. [2019-11-20 00:43:28,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 00:43:28,361 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:28,402 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 00:43:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:28,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 248 states and 371 transitions. [2019-11-20 00:43:28,671 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 371 transitions. [2019-11-20 00:43:28,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-20 00:43:28,673 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:28,696 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 00:43:28,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:28,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 253 states and 377 transitions. [2019-11-20 00:43:28,744 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 377 transitions. [2019-11-20 00:43:28,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 00:43:28,746 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:28,773 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:43:29,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:29,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 259 states and 386 transitions. [2019-11-20 00:43:29,056 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 386 transitions. [2019-11-20 00:43:29,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 00:43:29,058 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:29,085 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:43:29,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:29,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 262 states and 389 transitions. [2019-11-20 00:43:29,258 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 389 transitions. [2019-11-20 00:43:29,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-20 00:43:29,259 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:29,449 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 00:43:30,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:30,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 276 states and 411 transitions. [2019-11-20 00:43:30,380 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 411 transitions. [2019-11-20 00:43:30,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 00:43:30,381 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:30,407 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 00:43:30,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:30,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 280 states and 418 transitions. [2019-11-20 00:43:30,711 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 418 transitions. [2019-11-20 00:43:30,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 00:43:30,712 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:30,740 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 00:43:30,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:30,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 281 states and 419 transitions. [2019-11-20 00:43:30,859 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 419 transitions. [2019-11-20 00:43:30,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 00:43:30,860 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:30,955 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 00:43:31,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:31,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 291 states and 430 transitions. [2019-11-20 00:43:31,917 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 430 transitions. [2019-11-20 00:43:31,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 00:43:31,918 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:31,958 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 00:43:32,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:32,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 296 states and 435 transitions. [2019-11-20 00:43:32,024 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 435 transitions. [2019-11-20 00:43:32,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 00:43:32,027 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:32,073 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 00:43:32,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:32,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 297 states and 435 transitions. [2019-11-20 00:43:32,209 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 435 transitions. [2019-11-20 00:43:32,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-20 00:43:32,211 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:32,244 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 00:43:33,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:33,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 307 states and 446 transitions. [2019-11-20 00:43:33,131 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 446 transitions. [2019-11-20 00:43:33,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-20 00:43:33,132 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:33,236 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 00:43:34,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:34,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 325 states and 472 transitions. [2019-11-20 00:43:34,753 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 472 transitions. [2019-11-20 00:43:34,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-20 00:43:34,755 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:34,784 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:43:35,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 329 states and 479 transitions. [2019-11-20 00:43:35,056 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 479 transitions. [2019-11-20 00:43:35,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 00:43:35,057 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:35,102 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:43:35,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:35,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 336 states and 489 transitions. [2019-11-20 00:43:35,369 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 489 transitions. [2019-11-20 00:43:35,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 00:43:35,370 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:35,396 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:43:35,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:35,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 338 states and 490 transitions. [2019-11-20 00:43:35,552 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 490 transitions. [2019-11-20 00:43:35,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 00:43:35,553 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:35,587 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:43:35,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:35,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 339 states and 492 transitions. [2019-11-20 00:43:35,895 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 492 transitions. [2019-11-20 00:43:35,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 00:43:35,896 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:35,922 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:43:36,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:36,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 340 states and 494 transitions. [2019-11-20 00:43:36,109 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 494 transitions. [2019-11-20 00:43:36,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 00:43:36,111 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:43:36,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:36,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 347 states and 503 transitions. [2019-11-20 00:43:36,407 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 503 transitions. [2019-11-20 00:43:36,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 00:43:36,408 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:36,442 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:43:36,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:36,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 349 states and 505 transitions. [2019-11-20 00:43:36,633 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 505 transitions. [2019-11-20 00:43:36,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 00:43:36,634 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:36,792 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 00:43:39,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:39,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 376 states and 541 transitions. [2019-11-20 00:43:39,217 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 541 transitions. [2019-11-20 00:43:39,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 00:43:39,219 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:39,351 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:43:41,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:41,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 398 states and 577 transitions. [2019-11-20 00:43:41,603 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 577 transitions. [2019-11-20 00:43:41,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 00:43:41,604 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:41,654 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:43:41,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:41,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 402 states and 580 transitions. [2019-11-20 00:43:41,973 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 580 transitions. [2019-11-20 00:43:41,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 00:43:41,974 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:42,106 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 00:43:43,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:43,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 418 states and 599 transitions. [2019-11-20 00:43:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 599 transitions. [2019-11-20 00:43:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 00:43:43,335 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:43,362 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:43:43,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:43,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 425 states and 608 transitions. [2019-11-20 00:43:43,661 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 608 transitions. [2019-11-20 00:43:43,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 00:43:43,667 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:43,702 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:43:43,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:43,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 430 states and 613 transitions. [2019-11-20 00:43:43,747 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 613 transitions. [2019-11-20 00:43:43,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 00:43:43,748 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:43,820 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:43:43,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:43,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 431 states and 614 transitions. [2019-11-20 00:43:43,975 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 614 transitions. [2019-11-20 00:43:43,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 00:43:43,976 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:44,026 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:43:44,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:44,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 434 states and 617 transitions. [2019-11-20 00:43:44,210 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 617 transitions. [2019-11-20 00:43:44,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 00:43:44,211 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:44,259 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:43:45,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:45,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 455 states and 642 transitions. [2019-11-20 00:43:45,232 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 642 transitions. [2019-11-20 00:43:45,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-20 00:43:45,233 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:45,286 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:43:46,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:46,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 466 states and 652 transitions. [2019-11-20 00:43:46,118 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 652 transitions. [2019-11-20 00:43:46,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 00:43:46,119 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:46,551 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 00:43:47,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:47,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 473 states and 664 transitions. [2019-11-20 00:43:47,920 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 664 transitions. [2019-11-20 00:43:47,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 00:43:47,922 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:47,952 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:43:48,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:48,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 480 states and 671 transitions. [2019-11-20 00:43:48,301 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 671 transitions. [2019-11-20 00:43:48,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 00:43:48,303 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:48,332 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:43:48,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:48,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 487 states and 678 transitions. [2019-11-20 00:43:48,383 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 678 transitions. [2019-11-20 00:43:48,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 00:43:48,384 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:48,417 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 00:43:48,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 489 states and 682 transitions. [2019-11-20 00:43:48,603 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 682 transitions. [2019-11-20 00:43:48,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 00:43:48,604 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:48,639 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 00:43:48,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:48,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 491 states and 684 transitions. [2019-11-20 00:43:48,667 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 684 transitions. [2019-11-20 00:43:48,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 00:43:48,669 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:48,830 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:43:49,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:49,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 495 states and 690 transitions. [2019-11-20 00:43:49,446 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 690 transitions. [2019-11-20 00:43:49,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 00:43:49,447 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:49,715 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:43:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:52,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 525 states and 728 transitions. [2019-11-20 00:43:52,066 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 728 transitions. [2019-11-20 00:43:52,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 00:43:52,068 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:52,117 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 00:43:52,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:52,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 539 states and 749 transitions. [2019-11-20 00:43:52,879 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 749 transitions. [2019-11-20 00:43:52,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 00:43:52,880 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:52,976 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 00:43:53,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:53,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 545 states and 756 transitions. [2019-11-20 00:43:53,544 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 756 transitions. [2019-11-20 00:43:53,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 00:43:53,549 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:53,595 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 00:43:53,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:53,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 552 states and 763 transitions. [2019-11-20 00:43:53,870 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 763 transitions. [2019-11-20 00:43:53,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-20 00:43:53,871 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:53,925 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 00:43:54,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:54,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 557 states and 769 transitions. [2019-11-20 00:43:54,231 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 769 transitions. [2019-11-20 00:43:54,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 00:43:54,232 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:54,267 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 00:43:56,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 587 states and 806 transitions. [2019-11-20 00:43:56,751 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 806 transitions. [2019-11-20 00:43:56,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 00:43:56,751 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:56,787 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 00:43:57,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:57,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 602 states and 823 transitions. [2019-11-20 00:43:57,695 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 823 transitions. [2019-11-20 00:43:57,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 00:43:57,696 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:57,733 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 00:43:57,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:57,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 606 states and 829 transitions. [2019-11-20 00:43:57,772 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 829 transitions. [2019-11-20 00:43:57,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-20 00:43:57,772 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:57,898 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:43:58,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:58,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 611 states and 838 transitions. [2019-11-20 00:43:58,745 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 838 transitions. [2019-11-20 00:43:58,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-20 00:43:58,745 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:58,777 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:43:59,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:43:59,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 614 states and 841 transitions. [2019-11-20 00:43:59,365 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 841 transitions. [2019-11-20 00:43:59,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 00:43:59,366 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:43:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:59,412 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 00:44:00,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:00,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 620 states and 850 transitions. [2019-11-20 00:44:00,221 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 850 transitions. [2019-11-20 00:44:00,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 00:44:00,222 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:00,271 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 00:44:00,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:00,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 621 states and 852 transitions. [2019-11-20 00:44:00,661 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 852 transitions. [2019-11-20 00:44:00,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 00:44:00,662 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:00,713 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 00:44:01,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:01,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 622 states and 853 transitions. [2019-11-20 00:44:01,096 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 853 transitions. [2019-11-20 00:44:01,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 00:44:01,097 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:01,156 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 00:44:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 623 states and 855 transitions. [2019-11-20 00:44:01,510 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 855 transitions. [2019-11-20 00:44:01,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-20 00:44:01,512 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:01,562 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 00:44:02,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 629 states and 863 transitions. [2019-11-20 00:44:02,243 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 863 transitions. [2019-11-20 00:44:02,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-20 00:44:02,244 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:02,266 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 00:44:02,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:02,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 638 states and 871 transitions. [2019-11-20 00:44:02,902 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 871 transitions. [2019-11-20 00:44:02,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-20 00:44:02,903 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:03,126 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:05,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:05,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 663 states and 912 transitions. [2019-11-20 00:44:05,519 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 912 transitions. [2019-11-20 00:44:05,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-20 00:44:05,521 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:05,677 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:07,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:07,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 675 states and 932 transitions. [2019-11-20 00:44:07,854 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 932 transitions. [2019-11-20 00:44:07,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 00:44:07,855 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:08,107 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:44:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 700 states and 958 transitions. [2019-11-20 00:44:09,002 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 958 transitions. [2019-11-20 00:44:09,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 00:44:09,003 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:09,031 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:10,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 711 states and 974 transitions. [2019-11-20 00:44:10,251 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 974 transitions. [2019-11-20 00:44:10,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 00:44:10,252 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:10,282 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 00:44:11,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:11,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 718 states and 982 transitions. [2019-11-20 00:44:11,170 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 982 transitions. [2019-11-20 00:44:11,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 00:44:11,171 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:11,199 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 00:44:11,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:11,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 719 states and 983 transitions. [2019-11-20 00:44:11,594 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 983 transitions. [2019-11-20 00:44:11,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 00:44:11,595 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:11,620 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 00:44:11,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:11,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 721 states and 984 transitions. [2019-11-20 00:44:11,806 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 984 transitions. [2019-11-20 00:44:11,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 00:44:11,807 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:11,836 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 00:44:12,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:12,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 723 states and 985 transitions. [2019-11-20 00:44:12,124 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 985 transitions. [2019-11-20 00:44:12,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 00:44:12,125 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:44:12,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:12,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 733 states and 996 transitions. [2019-11-20 00:44:12,232 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 996 transitions. [2019-11-20 00:44:12,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 00:44:12,233 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:12,267 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:44:12,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:12,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 734 states and 997 transitions. [2019-11-20 00:44:12,473 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 997 transitions. [2019-11-20 00:44:12,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 00:44:12,474 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:12,531 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:44:14,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:14,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 747 states and 1019 transitions. [2019-11-20 00:44:14,035 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1019 transitions. [2019-11-20 00:44:14,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 00:44:14,036 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:14,545 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 00:44:17,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:17,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 789 states and 1063 transitions. [2019-11-20 00:44:17,915 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1063 transitions. [2019-11-20 00:44:17,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 00:44:17,916 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:18,174 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:19,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 799 states and 1083 transitions. [2019-11-20 00:44:19,632 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1083 transitions. [2019-11-20 00:44:19,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 00:44:19,633 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:19,664 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:19,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:19,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 800 states and 1083 transitions. [2019-11-20 00:44:19,872 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1083 transitions. [2019-11-20 00:44:19,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 00:44:19,873 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:19,906 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:20,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:20,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 801 states and 1084 transitions. [2019-11-20 00:44:20,310 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1084 transitions. [2019-11-20 00:44:20,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-20 00:44:20,311 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:44:21,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:21,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 811 states and 1096 transitions. [2019-11-20 00:44:21,556 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1096 transitions. [2019-11-20 00:44:21,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-20 00:44:21,557 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:21,619 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:44:21,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:21,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 813 states and 1098 transitions. [2019-11-20 00:44:21,969 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1098 transitions. [2019-11-20 00:44:21,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-20 00:44:21,970 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:22,007 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:24,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:24,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 827 states and 1120 transitions. [2019-11-20 00:44:24,850 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1120 transitions. [2019-11-20 00:44:24,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-20 00:44:24,852 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:25,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:25,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 830 states and 1124 transitions. [2019-11-20 00:44:25,696 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1124 transitions. [2019-11-20 00:44:25,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-20 00:44:25,697 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:25,728 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:26,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:26,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 832 states and 1126 transitions. [2019-11-20 00:44:26,422 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1126 transitions. [2019-11-20 00:44:26,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-20 00:44:26,423 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:26,450 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:26,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:26,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 837 states and 1132 transitions. [2019-11-20 00:44:26,857 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1132 transitions. [2019-11-20 00:44:26,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:44:26,859 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:26,893 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 00:44:27,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:27,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 839 states and 1135 transitions. [2019-11-20 00:44:27,094 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1135 transitions. [2019-11-20 00:44:27,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:44:27,095 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:27,127 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 00:44:27,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:27,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 840 states and 1136 transitions. [2019-11-20 00:44:27,223 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1136 transitions. [2019-11-20 00:44:27,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:44:27,224 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:27,261 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:44:31,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:31,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 878 states and 1181 transitions. [2019-11-20 00:44:31,147 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1181 transitions. [2019-11-20 00:44:31,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:44:31,149 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:31,193 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:44:32,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:32,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 891 states and 1193 transitions. [2019-11-20 00:44:32,639 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1193 transitions. [2019-11-20 00:44:32,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:44:32,640 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:44:33,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:33,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 935 states and 1239 transitions. [2019-11-20 00:44:33,955 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1239 transitions. [2019-11-20 00:44:33,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:44:33,956 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:33,980 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 00:44:34,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:34,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 936 states and 1239 transitions. [2019-11-20 00:44:34,168 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1239 transitions. [2019-11-20 00:44:34,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:44:34,169 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:34,199 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:44:34,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:34,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 937 states and 1239 transitions. [2019-11-20 00:44:34,477 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1239 transitions. [2019-11-20 00:44:34,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:44:34,478 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:34,508 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:44:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:34,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 938 states and 1239 transitions. [2019-11-20 00:44:34,583 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1239 transitions. [2019-11-20 00:44:34,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:44:34,584 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:34,624 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:44:35,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:35,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 939 states and 1240 transitions. [2019-11-20 00:44:35,133 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1240 transitions. [2019-11-20 00:44:35,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-20 00:44:35,134 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:44:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 958 states and 1270 transitions. [2019-11-20 00:44:40,200 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1270 transitions. [2019-11-20 00:44:40,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-20 00:44:40,201 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:40,228 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-20 00:44:41,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:41,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 960 states and 1273 transitions. [2019-11-20 00:44:41,004 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1273 transitions. [2019-11-20 00:44:41,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-20 00:44:41,005 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:41,038 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-20 00:44:41,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:41,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 962 states and 1276 transitions. [2019-11-20 00:44:41,540 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1276 transitions. [2019-11-20 00:44:41,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-20 00:44:41,541 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-20 00:44:42,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:42,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 975 states and 1296 transitions. [2019-11-20 00:44:42,951 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1296 transitions. [2019-11-20 00:44:42,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-20 00:44:42,953 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:42,987 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-20 00:44:43,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:43,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 976 states and 1297 transitions. [2019-11-20 00:44:43,403 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1297 transitions. [2019-11-20 00:44:43,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-20 00:44:43,404 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:43,544 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-11-20 00:44:45,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:45,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1056 states and 1388 transitions. [2019-11-20 00:44:45,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1388 transitions. [2019-11-20 00:44:45,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 00:44:45,752 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:45,791 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:47,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:47,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1072 states and 1405 transitions. [2019-11-20 00:44:47,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1405 transitions. [2019-11-20 00:44:47,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 00:44:47,129 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:47,167 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:47,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:47,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1079 states and 1412 transitions. [2019-11-20 00:44:47,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1412 transitions. [2019-11-20 00:44:47,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 00:44:47,558 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:47,630 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:47,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:47,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1080 states and 1413 transitions. [2019-11-20 00:44:47,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1413 transitions. [2019-11-20 00:44:47,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 00:44:47,673 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:47,739 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:44:48,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:48,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1082 states and 1414 transitions. [2019-11-20 00:44:48,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1414 transitions. [2019-11-20 00:44:48,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 00:44:48,075 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:48,105 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-20 00:44:48,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:48,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1083 states and 1414 transitions. [2019-11-20 00:44:48,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1414 transitions. [2019-11-20 00:44:48,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 00:44:48,362 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:48,391 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-20 00:44:48,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:48,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1085 states and 1415 transitions. [2019-11-20 00:44:48,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1415 transitions. [2019-11-20 00:44:48,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-20 00:44:48,878 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:49,408 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 65 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:44:53,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:53,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1103 states and 1444 transitions. [2019-11-20 00:44:53,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1444 transitions. [2019-11-20 00:44:53,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-11-20 00:44:53,409 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:44:53,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:53,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1104 states and 1446 transitions. [2019-11-20 00:44:53,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1446 transitions. [2019-11-20 00:44:53,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-20 00:44:53,540 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:53,634 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:44:53,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:44:53,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1105 states and 1447 transitions. [2019-11-20 00:44:53,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1447 transitions. [2019-11-20 00:44:53,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-20 00:44:53,656 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:44:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:54,836 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 00:45:01,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:01,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1172 states and 1519 transitions. [2019-11-20 00:45:01,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1519 transitions. [2019-11-20 00:45:01,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 00:45:01,018 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:01,053 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-20 00:45:03,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1192 states and 1546 transitions. [2019-11-20 00:45:03,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1546 transitions. [2019-11-20 00:45:03,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 00:45:03,815 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:03,917 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:45:06,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:06,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1231 states and 1587 transitions. [2019-11-20 00:45:06,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1587 transitions. [2019-11-20 00:45:06,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 00:45:06,170 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:06,311 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:45:06,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:06,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1233 states and 1588 transitions. [2019-11-20 00:45:06,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1588 transitions. [2019-11-20 00:45:06,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-20 00:45:06,609 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:06,660 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-20 00:45:07,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1238 states and 1597 transitions. [2019-11-20 00:45:07,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1597 transitions. [2019-11-20 00:45:07,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 00:45:07,180 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-11-20 00:45:10,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:10,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1263 states and 1627 transitions. [2019-11-20 00:45:10,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 1627 transitions. [2019-11-20 00:45:10,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 00:45:10,485 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:10,532 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 00:45:10,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:10,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1274 states and 1639 transitions. [2019-11-20 00:45:10,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1639 transitions. [2019-11-20 00:45:10,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 00:45:10,628 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:10,672 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 00:45:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:11,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1285 states and 1654 transitions. [2019-11-20 00:45:11,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1654 transitions. [2019-11-20 00:45:11,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 00:45:11,636 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:11,667 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 00:45:12,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:12,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1293 states and 1663 transitions. [2019-11-20 00:45:12,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1663 transitions. [2019-11-20 00:45:12,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 00:45:12,557 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:12,754 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 00:45:13,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:13,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1300 states and 1671 transitions. [2019-11-20 00:45:13,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1671 transitions. [2019-11-20 00:45:13,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 00:45:13,690 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:14,455 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 109 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:45:18,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:18,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1330 states and 1707 transitions. [2019-11-20 00:45:18,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1707 transitions. [2019-11-20 00:45:18,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 00:45:18,535 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 109 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:45:19,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:19,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1332 states and 1709 transitions. [2019-11-20 00:45:19,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1709 transitions. [2019-11-20 00:45:19,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-20 00:45:19,233 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:19,313 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 109 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:45:20,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:20,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1339 states and 1717 transitions. [2019-11-20 00:45:20,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1717 transitions. [2019-11-20 00:45:20,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-20 00:45:20,800 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:20,832 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 00:45:20,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1340 states and 1718 transitions. [2019-11-20 00:45:20,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1718 transitions. [2019-11-20 00:45:20,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-20 00:45:20,857 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:20,889 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 00:45:20,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1341 states and 1720 transitions. [2019-11-20 00:45:20,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1720 transitions. [2019-11-20 00:45:20,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-20 00:45:20,916 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:21,254 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:45:22,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:22,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1351 states and 1738 transitions. [2019-11-20 00:45:22,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1738 transitions. [2019-11-20 00:45:22,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-20 00:45:22,882 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:23,018 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 00:45:23,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:23,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1355 states and 1742 transitions. [2019-11-20 00:45:23,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1742 transitions. [2019-11-20 00:45:23,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 00:45:23,722 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:23,767 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:45:25,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:25,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1372 states and 1764 transitions. [2019-11-20 00:45:25,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1764 transitions. [2019-11-20 00:45:25,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 00:45:25,993 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:26,438 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:45:27,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:27,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1378 states and 1771 transitions. [2019-11-20 00:45:27,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1771 transitions. [2019-11-20 00:45:27,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 00:45:27,619 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:27,709 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:45:28,322 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-11-20 00:45:29,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:29,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1443 states and 1835 transitions. [2019-11-20 00:45:29,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1835 transitions. [2019-11-20 00:45:29,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-20 00:45:29,144 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:29,634 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-20 00:45:30,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:30,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1448 states and 1843 transitions. [2019-11-20 00:45:30,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1843 transitions. [2019-11-20 00:45:30,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-20 00:45:30,792 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:30,834 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-20 00:45:31,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:31,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1449 states and 1846 transitions. [2019-11-20 00:45:31,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1449 states and 1846 transitions. [2019-11-20 00:45:31,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-20 00:45:31,351 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:31,406 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:45:32,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:32,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1458 states and 1860 transitions. [2019-11-20 00:45:32,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1860 transitions. [2019-11-20 00:45:32,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-20 00:45:32,451 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:32,518 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:45:33,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1460 states and 1862 transitions. [2019-11-20 00:45:33,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 1862 transitions. [2019-11-20 00:45:33,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-20 00:45:33,463 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:33,515 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:45:36,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:36,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1481 states and 1888 transitions. [2019-11-20 00:45:36,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 1888 transitions. [2019-11-20 00:45:36,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-20 00:45:36,094 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:36,158 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:45:36,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1888 states to 1482 states and 1888 transitions. [2019-11-20 00:45:36,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1888 transitions. [2019-11-20 00:45:36,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-20 00:45:36,913 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:36,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-20 00:45:37,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:37,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1489 states and 1896 transitions. [2019-11-20 00:45:37,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1896 transitions. [2019-11-20 00:45:37,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-20 00:45:37,469 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-20 00:45:38,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1491 states and 1898 transitions. [2019-11-20 00:45:38,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1898 transitions. [2019-11-20 00:45:38,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-20 00:45:38,061 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-20 00:45:38,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:38,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1492 states and 1898 transitions. [2019-11-20 00:45:38,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1898 transitions. [2019-11-20 00:45:38,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-20 00:45:38,394 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:38,613 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:45:41,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:41,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1502 states and 1916 transitions. [2019-11-20 00:45:41,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1916 transitions. [2019-11-20 00:45:41,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-20 00:45:41,362 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:41,397 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:45:42,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:42,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1505 states and 1922 transitions. [2019-11-20 00:45:42,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1922 transitions. [2019-11-20 00:45:42,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-20 00:45:42,802 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:42,852 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:45:43,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:43,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1507 states and 1925 transitions. [2019-11-20 00:45:43,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1925 transitions. [2019-11-20 00:45:43,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-20 00:45:43,663 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:44,664 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 91 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:45:46,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:46,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1516 states and 1936 transitions. [2019-11-20 00:45:46,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 1936 transitions. [2019-11-20 00:45:46,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-20 00:45:46,551 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:46,596 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:45:48,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:48,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1526 states and 1949 transitions. [2019-11-20 00:45:48,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1949 transitions. [2019-11-20 00:45:48,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-20 00:45:48,684 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:49,023 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 91 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:45:52,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:45:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1538 states and 1963 transitions. [2019-11-20 00:45:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 1963 transitions. [2019-11-20 00:45:52,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-20 00:45:52,031 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:45:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:45:53,606 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 98 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:00,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:00,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 1594 states and 2028 transitions. [2019-11-20 00:46:00,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2028 transitions. [2019-11-20 00:46:00,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-20 00:46:00,314 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:00,365 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-20 00:46:01,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:01,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 1619 states and 2053 transitions. [2019-11-20 00:46:01,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 2053 transitions. [2019-11-20 00:46:01,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-20 00:46:01,574 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:01,626 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-20 00:46:02,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:02,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 1623 states and 2058 transitions. [2019-11-20 00:46:02,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2058 transitions. [2019-11-20 00:46:02,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-20 00:46:02,031 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:02,079 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-20 00:46:02,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:02,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 1624 states and 2058 transitions. [2019-11-20 00:46:02,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2058 transitions. [2019-11-20 00:46:02,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-20 00:46:02,612 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:03,500 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 00:46:07,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:07,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 1631 states and 2070 transitions. [2019-11-20 00:46:07,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2070 transitions. [2019-11-20 00:46:07,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-20 00:46:07,500 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:46:08,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:08,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 1632 states and 2072 transitions. [2019-11-20 00:46:08,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 2072 transitions. [2019-11-20 00:46:08,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-20 00:46:08,380 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:46:09,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:09,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 1638 states and 2079 transitions. [2019-11-20 00:46:09,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2079 transitions. [2019-11-20 00:46:09,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-20 00:46:09,155 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:09,214 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:46:10,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:10,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 1640 states and 2082 transitions. [2019-11-20 00:46:10,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2082 transitions. [2019-11-20 00:46:10,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-20 00:46:10,487 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:10,548 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:46:11,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:11,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 1646 states and 2088 transitions. [2019-11-20 00:46:11,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2088 transitions. [2019-11-20 00:46:11,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-20 00:46:11,718 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:11,761 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 00:46:12,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:12,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 1651 states and 2096 transitions. [2019-11-20 00:46:12,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2096 transitions. [2019-11-20 00:46:12,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-20 00:46:12,097 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:12,135 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 00:46:12,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:12,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 1656 states and 2100 transitions. [2019-11-20 00:46:12,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2100 transitions. [2019-11-20 00:46:12,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-20 00:46:12,706 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:12,757 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-20 00:46:13,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:13,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 1661 states and 2107 transitions. [2019-11-20 00:46:13,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2107 transitions. [2019-11-20 00:46:13,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-20 00:46:13,884 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:13,966 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:46:15,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:15,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 1666 states and 2115 transitions. [2019-11-20 00:46:15,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2115 transitions. [2019-11-20 00:46:15,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-20 00:46:15,040 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:15,311 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-20 00:46:17,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:17,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 1671 states and 2129 transitions. [2019-11-20 00:46:17,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2129 transitions. [2019-11-20 00:46:17,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-20 00:46:17,057 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:17,183 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 107 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:19,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:19,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 1676 states and 2136 transitions. [2019-11-20 00:46:19,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2136 transitions. [2019-11-20 00:46:19,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-20 00:46:19,557 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-20 00:46:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:21,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 1681 states and 2145 transitions. [2019-11-20 00:46:21,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2145 transitions. [2019-11-20 00:46:21,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-20 00:46:21,634 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:21,672 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 00:46:22,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:22,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 1700 states and 2165 transitions. [2019-11-20 00:46:22,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2165 transitions. [2019-11-20 00:46:22,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-20 00:46:22,191 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:22,250 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:23,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:23,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 1709 states and 2174 transitions. [2019-11-20 00:46:23,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2174 transitions. [2019-11-20 00:46:23,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-20 00:46:23,136 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:23,210 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:23,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:23,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2175 states to 1711 states and 2175 transitions. [2019-11-20 00:46:23,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2175 transitions. [2019-11-20 00:46:23,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-20 00:46:23,902 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:23,966 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:24,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 1713 states and 2176 transitions. [2019-11-20 00:46:24,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2176 transitions. [2019-11-20 00:46:24,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-20 00:46:24,057 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:24,886 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:29,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:29,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 1737 states and 2203 transitions. [2019-11-20 00:46:29,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2203 transitions. [2019-11-20 00:46:29,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-20 00:46:29,859 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:30,170 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:31,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2204 states to 1739 states and 2204 transitions. [2019-11-20 00:46:31,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2204 transitions. [2019-11-20 00:46:31,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-20 00:46:31,003 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:31,464 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 1750 states and 2215 transitions. [2019-11-20 00:46:34,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2215 transitions. [2019-11-20 00:46:34,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-20 00:46:34,827 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:34,881 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-20 00:46:35,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:35,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 1751 states and 2217 transitions. [2019-11-20 00:46:35,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2217 transitions. [2019-11-20 00:46:35,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-11-20 00:46:35,613 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:35,962 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:36,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 1752 states and 2218 transitions. [2019-11-20 00:46:36,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2218 transitions. [2019-11-20 00:46:36,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-20 00:46:36,502 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:36,685 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 183 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-20 00:46:37,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:37,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 1775 states and 2242 transitions. [2019-11-20 00:46:37,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2242 transitions. [2019-11-20 00:46:37,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-20 00:46:37,479 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:37,832 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-20 00:46:39,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:39,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 1845 states and 2316 transitions. [2019-11-20 00:46:39,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2316 transitions. [2019-11-20 00:46:39,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-11-20 00:46:39,509 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:39,608 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-20 00:46:40,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:40,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 1855 states and 2328 transitions. [2019-11-20 00:46:40,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 2328 transitions. [2019-11-20 00:46:40,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-20 00:46:40,710 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:40,752 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-20 00:46:41,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:41,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 1857 states and 2329 transitions. [2019-11-20 00:46:41,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2329 transitions. [2019-11-20 00:46:41,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 00:46:41,229 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:43,628 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 00:46:49,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:49,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 1890 states and 2364 transitions. [2019-11-20 00:46:49,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2364 transitions. [2019-11-20 00:46:49,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 00:46:49,636 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:49,854 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 00:46:51,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:51,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 1902 states and 2376 transitions. [2019-11-20 00:46:51,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2376 transitions. [2019-11-20 00:46:51,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 00:46:51,150 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:51,300 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 00:46:52,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:52,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 1905 states and 2380 transitions. [2019-11-20 00:46:52,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 2380 transitions. [2019-11-20 00:46:52,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 00:46:52,169 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:52,222 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:54,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:54,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2399 states to 1923 states and 2399 transitions. [2019-11-20 00:46:54,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 2399 transitions. [2019-11-20 00:46:54,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 00:46:54,492 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:54,545 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:46:56,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:46:56,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2407 states to 1931 states and 2407 transitions. [2019-11-20 00:46:56,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2407 transitions. [2019-11-20 00:46:56,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 00:46:56,831 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:46:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:46:56,883 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:47:01,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:01,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 1943 states and 2420 transitions. [2019-11-20 00:47:01,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 2420 transitions. [2019-11-20 00:47:01,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 00:47:01,028 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:47:03,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:03,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 1950 states and 2427 transitions. [2019-11-20 00:47:03,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2427 transitions. [2019-11-20 00:47:03,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-20 00:47:03,437 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:03,494 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-20 00:47:04,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:04,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 1959 states and 2441 transitions. [2019-11-20 00:47:04,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 2441 transitions. [2019-11-20 00:47:04,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-20 00:47:04,312 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:04,362 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-20 00:47:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:05,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 1967 states and 2448 transitions. [2019-11-20 00:47:05,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 2448 transitions. [2019-11-20 00:47:05,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-20 00:47:05,408 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:05,474 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-20 00:47:06,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:06,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 1968 states and 2448 transitions. [2019-11-20 00:47:06,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 2448 transitions. [2019-11-20 00:47:06,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-20 00:47:06,194 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:06,247 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-20 00:47:08,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:08,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2480 states to 1996 states and 2480 transitions. [2019-11-20 00:47:08,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 2480 transitions. [2019-11-20 00:47:08,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-20 00:47:08,239 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 170 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:47:14,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:14,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2050 states and 2545 transitions. [2019-11-20 00:47:14,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 2545 transitions. [2019-11-20 00:47:14,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-20 00:47:14,658 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:14,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:15,297 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 190 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:47:20,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:20,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2063 states and 2565 transitions. [2019-11-20 00:47:20,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 2565 transitions. [2019-11-20 00:47:20,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-20 00:47:20,199 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:20,680 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-20 00:47:21,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:21,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2567 states to 2066 states and 2567 transitions. [2019-11-20 00:47:21,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 2567 transitions. [2019-11-20 00:47:21,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-20 00:47:21,533 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:22,770 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 165 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:47:28,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:28,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2603 states to 2094 states and 2603 transitions. [2019-11-20 00:47:28,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 2603 transitions. [2019-11-20 00:47:28,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-20 00:47:28,549 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:31,519 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 00:47:39,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:39,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2653 states to 2142 states and 2653 transitions. [2019-11-20 00:47:39,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 2653 transitions. [2019-11-20 00:47:39,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-20 00:47:39,118 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:39,571 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 00:47:40,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:40,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2144 states and 2654 transitions. [2019-11-20 00:47:40,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 2654 transitions. [2019-11-20 00:47:40,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-20 00:47:40,179 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:40,244 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 00:47:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:42,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2727 states to 2214 states and 2727 transitions. [2019-11-20 00:47:42,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 2727 transitions. [2019-11-20 00:47:42,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-11-20 00:47:42,151 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:42,623 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-20 00:47:45,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:45,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2283 states and 2800 transitions. [2019-11-20 00:47:45,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 2800 transitions. [2019-11-20 00:47:45,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-20 00:47:45,636 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:47,626 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:47:50,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2811 states to 2293 states and 2811 transitions. [2019-11-20 00:47:50,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 2811 transitions. [2019-11-20 00:47:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-20 00:47:50,498 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:50,854 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 00:47:52,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:52,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2296 states and 2815 transitions. [2019-11-20 00:47:52,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 2815 transitions. [2019-11-20 00:47:52,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-20 00:47:52,092 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:52,264 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-11-20 00:47:58,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:58,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2863 states to 2331 states and 2863 transitions. [2019-11-20 00:47:58,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2331 states and 2863 transitions. [2019-11-20 00:47:58,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-20 00:47:58,094 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:58,223 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-11-20 00:47:58,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:47:58,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2863 states to 2332 states and 2863 transitions. [2019-11-20 00:47:58,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 2863 transitions. [2019-11-20 00:47:58,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-20 00:47:58,598 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:47:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:47:58,789 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-11-20 00:48:00,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:00,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2874 states to 2346 states and 2874 transitions. [2019-11-20 00:48:00,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 2874 transitions. [2019-11-20 00:48:00,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-20 00:48:00,976 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:03,653 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 00:48:07,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:07,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2351 states and 2882 transitions. [2019-11-20 00:48:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 2882 transitions. [2019-11-20 00:48:07,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-20 00:48:07,280 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-20 00:48:09,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:09,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2897 states to 2364 states and 2897 transitions. [2019-11-20 00:48:09,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 2897 transitions. [2019-11-20 00:48:09,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-20 00:48:09,293 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:09,368 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-20 00:48:11,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:11,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2914 states to 2379 states and 2914 transitions. [2019-11-20 00:48:11,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 2914 transitions. [2019-11-20 00:48:11,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-20 00:48:11,991 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:12,066 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-20 00:48:12,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:12,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2917 states to 2381 states and 2917 transitions. [2019-11-20 00:48:12,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 2917 transitions. [2019-11-20 00:48:12,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-20 00:48:12,865 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:12,958 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-20 00:48:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:17,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2941 states to 2400 states and 2941 transitions. [2019-11-20 00:48:17,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 2941 transitions. [2019-11-20 00:48:17,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-20 00:48:17,175 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:17,251 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-20 00:48:18,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:18,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2943 states to 2402 states and 2943 transitions. [2019-11-20 00:48:18,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2402 states and 2943 transitions. [2019-11-20 00:48:18,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-20 00:48:18,060 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:18,153 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-20 00:48:18,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:18,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2403 states and 2944 transitions. [2019-11-20 00:48:18,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 2944 transitions. [2019-11-20 00:48:18,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-20 00:48:18,958 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:19,033 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-20 00:48:19,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2405 states and 2945 transitions. [2019-11-20 00:48:19,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 2945 transitions. [2019-11-20 00:48:19,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-20 00:48:19,887 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:20,026 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 295 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:48:24,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:24,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2980 states to 2429 states and 2980 transitions. [2019-11-20 00:48:24,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 2980 transitions. [2019-11-20 00:48:24,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-20 00:48:24,785 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:24,890 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 295 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:48:26,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:26,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2434 states and 2986 transitions. [2019-11-20 00:48:26,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 2986 transitions. [2019-11-20 00:48:26,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-20 00:48:26,567 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:26,672 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 295 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:48:29,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:29,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2996 states to 2445 states and 2996 transitions. [2019-11-20 00:48:29,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 2996 transitions. [2019-11-20 00:48:29,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-20 00:48:29,794 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:29,899 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 295 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:48:32,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:32,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3003 states to 2450 states and 3003 transitions. [2019-11-20 00:48:32,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 3003 transitions. [2019-11-20 00:48:32,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-20 00:48:32,373 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:32,477 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 295 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:48:33,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:33,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3015 states to 2463 states and 3015 transitions. [2019-11-20 00:48:33,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 3015 transitions. [2019-11-20 00:48:33,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-20 00:48:33,701 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:33,805 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 295 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:48:35,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:35,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 2472 states and 3022 transitions. [2019-11-20 00:48:35,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3022 transitions. [2019-11-20 00:48:35,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-20 00:48:35,484 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 295 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:48:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:35,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3024 states to 2474 states and 3024 transitions. [2019-11-20 00:48:35,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3024 transitions. [2019-11-20 00:48:35,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-20 00:48:35,672 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:35,776 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 295 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:48:37,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:37,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 2481 states and 3030 transitions. [2019-11-20 00:48:37,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3030 transitions. [2019-11-20 00:48:37,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-20 00:48:37,039 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 295 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:48:38,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:38,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3032 states to 2483 states and 3032 transitions. [2019-11-20 00:48:38,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 3032 transitions. [2019-11-20 00:48:38,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-11-20 00:48:38,754 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:38,871 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 295 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 00:48:39,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:39,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3033 states to 2485 states and 3033 transitions. [2019-11-20 00:48:39,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2485 states and 3033 transitions. [2019-11-20 00:48:39,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-20 00:48:39,756 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:41,140 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 157 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:48:45,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:45,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3051 states to 2501 states and 3051 transitions. [2019-11-20 00:48:45,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2501 states and 3051 transitions. [2019-11-20 00:48:45,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-20 00:48:45,019 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:45,366 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 157 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:48:46,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:46,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 2507 states and 3058 transitions. [2019-11-20 00:48:46,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3058 transitions. [2019-11-20 00:48:46,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-20 00:48:46,525 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:46,871 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 157 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:48:48,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:48,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 2519 states and 3073 transitions. [2019-11-20 00:48:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2519 states and 3073 transitions. [2019-11-20 00:48:48,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-20 00:48:48,587 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:48,934 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 157 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:48:49,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:49,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 2524 states and 3077 transitions. [2019-11-20 00:48:49,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2524 states and 3077 transitions. [2019-11-20 00:48:49,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-11-20 00:48:49,949 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:50,295 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 157 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:48:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:51,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 2528 states and 3080 transitions. [2019-11-20 00:48:51,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2528 states and 3080 transitions. [2019-11-20 00:48:51,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-20 00:48:51,850 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:53,796 WARN L191 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2019-11-20 00:48:53,904 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 71 proven. 187 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-20 00:48:58,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:48:58,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 2543 states and 3109 transitions. [2019-11-20 00:48:58,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 3109 transitions. [2019-11-20 00:48:58,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-11-20 00:48:58,037 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:48:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:48:58,480 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 276 proven. 7 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 00:49:00,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-11-20 00:49:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 2557 states and 3125 transitions. [2019-11-20 00:49:00,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 3125 transitions. [2019-11-20 00:49:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-20 00:49:00,863 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-11-20 00:49:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:49:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:49:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:49:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:49:01,282 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 220 iterations. [2019-11-20 00:49:01,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 20.11 12:49:01 ImpRootNode [2019-11-20 00:49:01,483 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-11-20 00:49:01,484 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:49:01,484 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:49:01,484 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:49:01,485 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:43:23" (3/4) ... [2019-11-20 00:49:01,487 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 00:49:01,639 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_545a4b02-7d03-4f45-9784-95558e5a3197/bin/ukojak/witness.graphml [2019-11-20 00:49:01,639 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:49:01,640 INFO L168 Benchmark]: Toolchain (without parser) took 340737.17 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 939.3 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-11-20 00:49:01,641 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:49:01,641 INFO L168 Benchmark]: CACSL2BoogieTranslator took 569.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -181.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-20 00:49:01,641 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.27 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 00:49:01,642 INFO L168 Benchmark]: Boogie Preprocessor took 58.96 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 00:49:01,642 INFO L168 Benchmark]: RCFGBuilder took 2112.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 897.5 MB in the end (delta: 212.3 MB). Peak memory consumption was 212.3 MB. Max. memory is 11.5 GB. [2019-11-20 00:49:01,643 INFO L168 Benchmark]: CodeCheck took 337758.82 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 897.5 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-11-20 00:49:01,643 INFO L168 Benchmark]: Witness Printer took 155.26 ms. Allocated memory is still 4.6 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-11-20 00:49:01,645 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: 337.5s, OverallIterations: 220, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1140850964 SDtfs, -706819714 SDslu, 335545976 SDs, 0 SdLazy, -110302752 SolverSat, 1275876054 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1222.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 217114 GetRequests, 209084 SyntacticMatches, 5910 SemanticMatches, 2120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3435368 ImplicationChecksByTransitivity, 303.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.9s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 35.4s InterpolantComputationTime, 31937 NumberOfCodeBlocks, 31937 NumberOfCodeBlocksAsserted, 220 NumberOfCheckSat, 31483 ConstructedInterpolants, 0 QuantifiedInterpolants, 22170991 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 219 InterpolantComputations, 178 PerfectInterpolantSequences, 22902/24102 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: 422]: 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 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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [L278] COND TRUE (((((((!(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)) [L279] a20 = 1 [L280] a8 = 13 [L281] a16 = 4 [L282] a7 = 0 [L283] a21 = 1 [L284] a17 = 0 [L285] return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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=4, a17=0, a20=1, a21=1, a7=0, 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 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=13, 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=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L412] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L415] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L418] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L421] COND TRUE ((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L422] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 569.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -181.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.27 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.96 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2112.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 897.5 MB in the end (delta: 212.3 MB). Peak memory consumption was 212.3 MB. Max. memory is 11.5 GB. * CodeCheck took 337758.82 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 897.5 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 155.26 ms. Allocated memory is still 4.6 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...