./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label20_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_43445df4-96d6-4827-966f-4097116aea3e/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_43445df4-96d6-4827-966f-4097116aea3e/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_43445df4-96d6-4827-966f-4097116aea3e/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_43445df4-96d6-4827-966f-4097116aea3e/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label20_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_43445df4-96d6-4827-966f-4097116aea3e/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_43445df4-96d6-4827-966f-4097116aea3e/bin-2019/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 aaa39ce28677c06ea4974c4267a7bbc4385d14ab ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.23-1dbac8b [2018-10-26 23:27:30,244 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 23:27:30,245 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 23:27:30,255 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 23:27:30,255 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 23:27:30,256 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 23:27:30,257 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 23:27:30,259 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 23:27:30,261 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 23:27:30,262 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 23:27:30,262 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 23:27:30,263 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 23:27:30,264 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 23:27:30,265 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 23:27:30,265 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 23:27:30,266 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 23:27:30,267 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 23:27:30,269 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 23:27:30,270 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 23:27:30,272 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 23:27:30,273 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 23:27:30,274 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 23:27:30,276 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 23:27:30,276 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 23:27:30,276 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 23:27:30,277 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 23:27:30,278 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 23:27:30,279 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 23:27:30,280 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 23:27:30,281 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 23:27:30,281 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 23:27:30,281 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 23:27:30,282 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 23:27:30,282 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 23:27:30,282 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 23:27:30,284 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 23:27:30,284 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_43445df4-96d6-4827-966f-4097116aea3e/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-26 23:27:30,296 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 23:27:30,296 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 23:27:30,297 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 23:27:30,297 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 23:27:30,297 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 23:27:30,297 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 23:27:30,298 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 23:27:30,298 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 23:27:30,298 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 23:27:30,298 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 23:27:30,298 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 23:27:30,298 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 23:27:30,300 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 23:27:30,300 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 23:27:30,300 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 23:27:30,300 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 23:27:30,300 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 23:27:30,301 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-26 23:27:30,301 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-26 23:27:30,301 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 23:27:30,301 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 23:27:30,301 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-26 23:27:30,301 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 23:27:30,302 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 23:27:30,302 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 23:27:30,302 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-26 23:27:30,302 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 23:27:30,302 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 23:27:30,302 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_43445df4-96d6-4827-966f-4097116aea3e/bin-2019/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 -> aaa39ce28677c06ea4974c4267a7bbc4385d14ab [2018-10-26 23:27:30,333 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 23:27:30,343 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 23:27:30,346 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 23:27:30,348 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 23:27:30,348 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 23:27:30,349 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_43445df4-96d6-4827-966f-4097116aea3e/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label20_false-unreach-call_false-termination.c [2018-10-26 23:27:30,400 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_43445df4-96d6-4827-966f-4097116aea3e/bin-2019/ukojak/data/2954ce35e/038e72caa1234c948eecab9ce7110e87/FLAG428abc65d [2018-10-26 23:27:30,876 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 23:27:30,877 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_43445df4-96d6-4827-966f-4097116aea3e/sv-benchmarks/c/eca-rers2012/Problem01_label20_false-unreach-call_false-termination.c [2018-10-26 23:27:30,887 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_43445df4-96d6-4827-966f-4097116aea3e/bin-2019/ukojak/data/2954ce35e/038e72caa1234c948eecab9ce7110e87/FLAG428abc65d [2018-10-26 23:27:30,899 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_43445df4-96d6-4827-966f-4097116aea3e/bin-2019/ukojak/data/2954ce35e/038e72caa1234c948eecab9ce7110e87 [2018-10-26 23:27:30,902 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 23:27:30,904 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 23:27:30,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 23:27:30,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 23:27:30,908 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 23:27:30,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:27:30" (1/1) ... [2018-10-26 23:27:30,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4905e68d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:27:30, skipping insertion in model container [2018-10-26 23:27:30,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:27:30" (1/1) ... [2018-10-26 23:27:30,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 23:27:30,965 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 23:27:31,324 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:27:31,328 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 23:27:31,430 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:27:31,448 INFO L193 MainTranslator]: Completed translation [2018-10-26 23:27:31,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:27:31 WrapperNode [2018-10-26 23:27:31,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 23:27:31,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 23:27:31,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 23:27:31,449 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 23:27:31,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:27:31" (1/1) ... [2018-10-26 23:27:31,475 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:27:31" (1/1) ... [2018-10-26 23:27:31,524 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 23:27:31,524 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 23:27:31,524 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 23:27:31,524 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 23:27:31,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:27:31" (1/1) ... [2018-10-26 23:27:31,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:27:31" (1/1) ... [2018-10-26 23:27:31,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:27:31" (1/1) ... [2018-10-26 23:27:31,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:27:31" (1/1) ... [2018-10-26 23:27:31,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:27:31" (1/1) ... [2018-10-26 23:27:31,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:27:31" (1/1) ... [2018-10-26 23:27:31,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:27:31" (1/1) ... [2018-10-26 23:27:31,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 23:27:31,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 23:27:31,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 23:27:31,711 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 23:27:31,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:27:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_43445df4-96d6-4827-966f-4097116aea3e/bin-2019/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 [2018-10-26 23:27:31,773 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 23:27:31,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 23:27:31,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 23:27:36,627 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 23:27:36,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:27:36 BoogieIcfgContainer [2018-10-26 23:27:36,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 23:27:36,629 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-26 23:27:36,629 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-26 23:27:36,641 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-26 23:27:36,641 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:27:36" (1/1) ... [2018-10-26 23:27:36,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:27:36,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:36,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 77 states and 146 transitions. [2018-10-26 23:27:36,694 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 146 transitions. [2018-10-26 23:27:36,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-26 23:27:36,699 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:37,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:27:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:38,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 147 states and 223 transitions. [2018-10-26 23:27:38,121 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 223 transitions. [2018-10-26 23:27:38,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-26 23:27:38,124 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:27:38,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:38,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 152 states and 229 transitions. [2018-10-26 23:27:38,514 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 229 transitions. [2018-10-26 23:27:38,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-26 23:27:38,516 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:38,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:27:38,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:38,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 158 states and 240 transitions. [2018-10-26 23:27:38,993 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 240 transitions. [2018-10-26 23:27:38,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 23:27:38,994 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:39,155 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 23:27:40,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 236 states and 331 transitions. [2018-10-26 23:27:40,086 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 331 transitions. [2018-10-26 23:27:40,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-26 23:27:40,091 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:40,198 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 23:27:41,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:41,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 260 states and 362 transitions. [2018-10-26 23:27:41,045 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 362 transitions. [2018-10-26 23:27:41,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-26 23:27:41,047 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:41,231 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-26 23:27:41,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:41,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 271 states and 379 transitions. [2018-10-26 23:27:41,978 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 379 transitions. [2018-10-26 23:27:41,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-26 23:27:41,980 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:42,037 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 23:27:42,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:42,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 276 states and 384 transitions. [2018-10-26 23:27:42,115 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 384 transitions. [2018-10-26 23:27:42,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-26 23:27:42,116 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:42,264 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-26 23:27:42,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:42,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 288 states and 407 transitions. [2018-10-26 23:27:42,859 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 407 transitions. [2018-10-26 23:27:42,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-26 23:27:42,860 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:42,892 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-26 23:27:43,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:43,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 295 states and 417 transitions. [2018-10-26 23:27:43,448 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 417 transitions. [2018-10-26 23:27:43,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-26 23:27:43,449 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:43,482 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-26 23:27:43,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:43,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 302 states and 428 transitions. [2018-10-26 23:27:43,785 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 428 transitions. [2018-10-26 23:27:43,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-26 23:27:43,786 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:43,823 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-26 23:27:44,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:44,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 304 states and 430 transitions. [2018-10-26 23:27:44,013 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 430 transitions. [2018-10-26 23:27:44,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-26 23:27:44,014 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:44,046 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-26 23:27:44,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:44,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 308 states and 434 transitions. [2018-10-26 23:27:44,173 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 434 transitions. [2018-10-26 23:27:44,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-26 23:27:44,174 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-26 23:27:44,661 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-10-26 23:27:45,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:45,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 312 states and 438 transitions. [2018-10-26 23:27:45,445 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 438 transitions. [2018-10-26 23:27:45,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-26 23:27:45,447 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:45,496 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 23:27:45,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:45,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 318 states and 444 transitions. [2018-10-26 23:27:45,603 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 444 transitions. [2018-10-26 23:27:45,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-26 23:27:45,604 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:46,209 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-26 23:27:47,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:47,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 320 states and 447 transitions. [2018-10-26 23:27:47,529 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 447 transitions. [2018-10-26 23:27:47,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-26 23:27:47,529 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:47,581 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-26 23:27:48,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:48,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 326 states and 457 transitions. [2018-10-26 23:27:48,005 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 457 transitions. [2018-10-26 23:27:48,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-26 23:27:48,006 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:48,065 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-26 23:27:48,543 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-26 23:27:48,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:48,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 330 states and 465 transitions. [2018-10-26 23:27:48,739 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 465 transitions. [2018-10-26 23:27:48,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-26 23:27:48,740 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:48,791 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-26 23:27:49,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:49,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 333 states and 467 transitions. [2018-10-26 23:27:49,097 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 467 transitions. [2018-10-26 23:27:49,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-26 23:27:49,098 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:49,141 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-26 23:27:49,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 336 states and 469 transitions. [2018-10-26 23:27:49,412 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 469 transitions. [2018-10-26 23:27:49,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-26 23:27:49,413 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:49,587 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-26 23:27:49,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:49,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 341 states and 474 transitions. [2018-10-26 23:27:49,953 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 474 transitions. [2018-10-26 23:27:49,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:27:49,954 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:49,985 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-10-26 23:27:50,917 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-26 23:27:51,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:51,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 346 states and 482 transitions. [2018-10-26 23:27:51,014 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 482 transitions. [2018-10-26 23:27:51,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:27:51,015 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:51,054 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-10-26 23:27:51,667 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-26 23:27:52,379 WARN L179 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-10-26 23:27:53,643 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-26 23:27:54,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:54,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 353 states and 490 transitions. [2018-10-26 23:27:54,514 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 490 transitions. [2018-10-26 23:27:54,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:27:54,515 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:54,574 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-10-26 23:27:55,263 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-26 23:27:55,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:55,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 357 states and 494 transitions. [2018-10-26 23:27:55,473 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 494 transitions. [2018-10-26 23:27:55,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-26 23:27:55,474 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:58,197 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-26 23:27:58,211 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-26 23:27:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 363 states and 504 transitions. [2018-10-26 23:27:59,163 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 504 transitions. [2018-10-26 23:27:59,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-26 23:27:59,164 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:59,193 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-26 23:27:59,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:59,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 364 states and 504 transitions. [2018-10-26 23:27:59,442 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 504 transitions. [2018-10-26 23:27:59,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-26 23:27:59,442 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:59,476 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 23:27:59,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:27:59,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 378 states and 518 transitions. [2018-10-26 23:27:59,544 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 518 transitions. [2018-10-26 23:27:59,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-26 23:27:59,545 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:27:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:27:59,985 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:28:00,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:00,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 424 states and 568 transitions. [2018-10-26 23:28:00,514 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 568 transitions. [2018-10-26 23:28:00,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-26 23:28:00,515 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:00,538 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-26 23:28:00,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:00,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 433 states and 578 transitions. [2018-10-26 23:28:00,650 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 578 transitions. [2018-10-26 23:28:00,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-26 23:28:00,651 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:00,683 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 23:28:00,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:00,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 440 states and 586 transitions. [2018-10-26 23:28:00,773 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 586 transitions. [2018-10-26 23:28:00,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-26 23:28:00,773 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:00,884 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-26 23:28:01,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:01,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 454 states and 602 transitions. [2018-10-26 23:28:01,195 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 602 transitions. [2018-10-26 23:28:01,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-26 23:28:01,196 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:01,232 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-26 23:28:01,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:01,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 457 states and 605 transitions. [2018-10-26 23:28:01,517 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 605 transitions. [2018-10-26 23:28:01,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-26 23:28:01,517 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:01,944 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-26 23:28:02,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:02,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 471 states and 621 transitions. [2018-10-26 23:28:02,772 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 621 transitions. [2018-10-26 23:28:02,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-26 23:28:02,773 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:03,200 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-26 23:28:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 480 states and 639 transitions. [2018-10-26 23:28:03,677 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 639 transitions. [2018-10-26 23:28:03,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-26 23:28:03,677 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:03,746 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-26 23:28:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 482 states and 642 transitions. [2018-10-26 23:28:04,478 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 642 transitions. [2018-10-26 23:28:04,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-26 23:28:04,479 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:04,512 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-26 23:28:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:04,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 486 states and 649 transitions. [2018-10-26 23:28:04,689 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 649 transitions. [2018-10-26 23:28:04,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-26 23:28:04,690 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:05,324 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:28:06,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:06,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 551 states and 716 transitions. [2018-10-26 23:28:06,706 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 716 transitions. [2018-10-26 23:28:06,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-26 23:28:06,706 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:06,781 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-26 23:28:06,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:06,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 552 states and 716 transitions. [2018-10-26 23:28:06,840 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 716 transitions. [2018-10-26 23:28:06,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-26 23:28:06,841 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:07,398 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:28:09,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:09,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 621 states and 799 transitions. [2018-10-26 23:28:09,967 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 799 transitions. [2018-10-26 23:28:09,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-26 23:28:09,968 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:10,072 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:28:10,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:10,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 626 states and 804 transitions. [2018-10-26 23:28:10,627 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 804 transitions. [2018-10-26 23:28:10,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-26 23:28:10,627 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:10,964 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:28:11,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:11,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 696 states and 879 transitions. [2018-10-26 23:28:11,994 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 879 transitions. [2018-10-26 23:28:11,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-26 23:28:11,994 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:12,091 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-10-26 23:28:12,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:12,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 697 states and 879 transitions. [2018-10-26 23:28:12,122 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 879 transitions. [2018-10-26 23:28:12,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-26 23:28:12,123 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:12,516 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 115 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-26 23:28:13,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:13,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 703 states and 890 transitions. [2018-10-26 23:28:13,126 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 890 transitions. [2018-10-26 23:28:13,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-26 23:28:13,126 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:13,172 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 115 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-26 23:28:13,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 709 states and 897 transitions. [2018-10-26 23:28:13,613 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 897 transitions. [2018-10-26 23:28:13,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-26 23:28:13,614 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:13,663 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 115 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-26 23:28:14,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:14,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 713 states and 902 transitions. [2018-10-26 23:28:14,118 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 902 transitions. [2018-10-26 23:28:14,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-26 23:28:14,118 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:14,155 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-26 23:28:14,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:14,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 726 states and 920 transitions. [2018-10-26 23:28:14,661 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 920 transitions. [2018-10-26 23:28:14,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-26 23:28:14,662 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-26 23:28:14,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:14,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 728 states and 922 transitions. [2018-10-26 23:28:14,765 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 922 transitions. [2018-10-26 23:28:14,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-26 23:28:14,766 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:15,148 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-26 23:28:15,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:15,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 737 states and 934 transitions. [2018-10-26 23:28:15,706 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 934 transitions. [2018-10-26 23:28:15,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-26 23:28:15,707 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-26 23:28:15,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:15,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 741 states and 939 transitions. [2018-10-26 23:28:15,949 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 939 transitions. [2018-10-26 23:28:15,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-26 23:28:15,950 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:16,882 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 110 proven. 11 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-26 23:28:17,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:17,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 760 states and 962 transitions. [2018-10-26 23:28:17,522 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 962 transitions. [2018-10-26 23:28:17,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-26 23:28:17,523 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:18,097 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 165 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-26 23:28:19,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:19,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 774 states and 979 transitions. [2018-10-26 23:28:19,274 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 979 transitions. [2018-10-26 23:28:19,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-26 23:28:19,275 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:19,347 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-26 23:28:19,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:19,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 776 states and 981 transitions. [2018-10-26 23:28:19,627 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 981 transitions. [2018-10-26 23:28:19,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-26 23:28:19,628 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:20,367 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 112 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:28:26,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:26,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 845 states and 1068 transitions. [2018-10-26 23:28:26,070 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1068 transitions. [2018-10-26 23:28:26,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-26 23:28:26,071 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 112 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:28:28,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:28,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 870 states and 1097 transitions. [2018-10-26 23:28:28,546 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1097 transitions. [2018-10-26 23:28:28,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-26 23:28:28,547 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:28,677 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 112 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:28:29,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:29,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 881 states and 1109 transitions. [2018-10-26 23:28:29,384 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1109 transitions. [2018-10-26 23:28:29,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-26 23:28:29,385 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:29,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:29,487 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 127 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-26 23:28:31,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:31,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 954 states and 1193 transitions. [2018-10-26 23:28:31,224 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1193 transitions. [2018-10-26 23:28:31,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-26 23:28:31,225 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:31,746 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-26 23:28:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 964 states and 1216 transitions. [2018-10-26 23:28:34,162 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1216 transitions. [2018-10-26 23:28:34,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-26 23:28:34,163 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:34,336 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-26 23:28:35,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:35,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 968 states and 1223 transitions. [2018-10-26 23:28:35,143 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1223 transitions. [2018-10-26 23:28:35,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-26 23:28:35,144 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-26 23:28:36,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:36,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 971 states and 1230 transitions. [2018-10-26 23:28:36,154 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1230 transitions. [2018-10-26 23:28:36,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-26 23:28:36,155 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:36,829 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-26 23:28:37,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:37,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 973 states and 1231 transitions. [2018-10-26 23:28:37,112 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1231 transitions. [2018-10-26 23:28:37,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-26 23:28:37,113 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:37,355 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-26 23:28:37,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:37,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 974 states and 1231 transitions. [2018-10-26 23:28:37,611 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1231 transitions. [2018-10-26 23:28:37,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-26 23:28:37,612 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:37,887 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-26 23:28:38,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:38,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1020 states and 1283 transitions. [2018-10-26 23:28:38,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1283 transitions. [2018-10-26 23:28:38,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-26 23:28:38,942 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:39,011 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-10-26 23:28:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:39,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1023 states and 1287 transitions. [2018-10-26 23:28:39,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1287 transitions. [2018-10-26 23:28:39,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-26 23:28:39,782 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:39,848 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-26 23:28:40,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:40,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1026 states and 1291 transitions. [2018-10-26 23:28:40,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1291 transitions. [2018-10-26 23:28:40,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-26 23:28:40,375 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:41,339 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:28:43,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:43,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1051 states and 1323 transitions. [2018-10-26 23:28:43,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1323 transitions. [2018-10-26 23:28:43,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-26 23:28:43,249 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:28:43,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:43,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1055 states and 1327 transitions. [2018-10-26 23:28:43,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1327 transitions. [2018-10-26 23:28:43,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-26 23:28:43,717 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:43,770 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-26 23:28:45,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:45,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1077 states and 1352 transitions. [2018-10-26 23:28:45,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1352 transitions. [2018-10-26 23:28:45,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-26 23:28:45,149 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:45,183 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-26 23:28:46,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:46,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1087 states and 1363 transitions. [2018-10-26 23:28:46,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1363 transitions. [2018-10-26 23:28:46,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-26 23:28:46,341 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:46,585 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 245 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-26 23:28:47,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:47,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1096 states and 1373 transitions. [2018-10-26 23:28:47,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1373 transitions. [2018-10-26 23:28:47,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-26 23:28:47,544 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:47,758 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 245 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-26 23:28:48,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:48,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1100 states and 1377 transitions. [2018-10-26 23:28:48,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1377 transitions. [2018-10-26 23:28:48,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-26 23:28:48,071 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:48,109 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-26 23:28:48,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1105 states and 1382 transitions. [2018-10-26 23:28:48,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1382 transitions. [2018-10-26 23:28:48,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-26 23:28:48,453 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:28:53,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:53,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1146 states and 1432 transitions. [2018-10-26 23:28:53,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1432 transitions. [2018-10-26 23:28:53,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-26 23:28:53,345 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:53,657 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:28:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:54,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1149 states and 1436 transitions. [2018-10-26 23:28:54,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1436 transitions. [2018-10-26 23:28:54,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-26 23:28:54,573 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:54,887 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:28:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:54,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1161 states and 1448 transitions. [2018-10-26 23:28:54,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1448 transitions. [2018-10-26 23:28:54,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-26 23:28:54,957 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:55,284 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:28:55,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:55,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1166 states and 1453 transitions. [2018-10-26 23:28:55,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1453 transitions. [2018-10-26 23:28:55,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-26 23:28:55,586 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:55,643 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 138 proven. 5 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-26 23:28:56,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:56,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1197 states and 1486 transitions. [2018-10-26 23:28:56,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1486 transitions. [2018-10-26 23:28:56,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-26 23:28:56,023 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-26 23:28:56,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:28:56,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1268 states and 1560 transitions. [2018-10-26 23:28:56,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1560 transitions. [2018-10-26 23:28:56,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-26 23:28:56,728 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:28:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:56,765 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-26 23:29:01,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:29:01,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1326 states and 1626 transitions. [2018-10-26 23:29:01,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1626 transitions. [2018-10-26 23:29:01,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-26 23:29:01,604 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:29:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:01,639 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-26 23:29:03,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:29:03,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1346 states and 1646 transitions. [2018-10-26 23:29:03,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1646 transitions. [2018-10-26 23:29:03,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-26 23:29:03,127 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:29:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:03,721 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 252 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-26 23:29:05,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:29:05,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1388 states and 1699 transitions. [2018-10-26 23:29:05,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1699 transitions. [2018-10-26 23:29:05,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-26 23:29:05,823 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:29:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:05,892 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 252 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-26 23:29:06,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:29:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1397 states and 1710 transitions. [2018-10-26 23:29:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1710 transitions. [2018-10-26 23:29:06,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-26 23:29:06,396 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:29:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:07,682 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-26 23:29:10,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:29:10,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1425 states and 1742 transitions. [2018-10-26 23:29:10,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 1742 transitions. [2018-10-26 23:29:10,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-26 23:29:10,618 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:29:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:10,748 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-26 23:29:12,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:29:12,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1445 states and 1760 transitions. [2018-10-26 23:29:12,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1760 transitions. [2018-10-26 23:29:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-26 23:29:12,484 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:29:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:12,627 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-26 23:29:13,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:29:13,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1450 states and 1764 transitions. [2018-10-26 23:29:13,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 1764 transitions. [2018-10-26 23:29:13,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-26 23:29:13,182 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:29:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:13,741 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-10-26 23:29:14,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:29:14,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1521 states and 1839 transitions. [2018-10-26 23:29:14,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1839 transitions. [2018-10-26 23:29:14,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-26 23:29:14,970 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:29:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:15,413 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-10-26 23:29:16,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:29:16,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1620 states and 1944 transitions. [2018-10-26 23:29:16,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 1944 transitions. [2018-10-26 23:29:16,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-26 23:29:16,499 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:29:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:17,741 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 288 proven. 23 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:29:21,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:29:21,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1665 states and 1994 transitions. [2018-10-26 23:29:21,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 1994 transitions. [2018-10-26 23:29:21,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-26 23:29:21,274 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:29:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:22,505 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 288 proven. 23 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:29:23,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:29:23,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 1674 states and 2003 transitions. [2018-10-26 23:29:23,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2003 transitions. [2018-10-26 23:29:23,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-26 23:29:23,459 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:29:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 229 proven. 134 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:29:27,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:29:27,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 1722 states and 2067 transitions. [2018-10-26 23:29:27,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2067 transitions. [2018-10-26 23:29:27,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-26 23:29:27,062 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:29:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:27,262 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-10-26 23:29:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:29:27,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 1743 states and 2087 transitions. [2018-10-26 23:29:27,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2087 transitions. [2018-10-26 23:29:27,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-26 23:29:27,477 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:29:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:27,550 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-10-26 23:29:27,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:29:27,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 1747 states and 2090 transitions. [2018-10-26 23:29:27,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 2090 transitions. [2018-10-26 23:29:27,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-26 23:29:27,740 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:29:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:28,827 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 396 proven. 5 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-26 23:29:40,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:29:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 1884 states and 2276 transitions. [2018-10-26 23:29:40,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2276 transitions. [2018-10-26 23:29:40,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-26 23:29:40,396 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:29:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:40,880 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:29:42,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:29:42,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 1892 states and 2284 transitions. [2018-10-26 23:29:42,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2284 transitions. [2018-10-26 23:29:42,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-26 23:29:42,865 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:29:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:43,241 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:29:44,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:29:44,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 1901 states and 2292 transitions. [2018-10-26 23:29:44,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2292 transitions. [2018-10-26 23:29:44,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-26 23:29:44,294 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:29:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:45,378 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 274 proven. 50 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:29:48,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:29:48,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 1914 states and 2312 transitions. [2018-10-26 23:29:48,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2312 transitions. [2018-10-26 23:29:48,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-26 23:29:48,872 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:29:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:49,049 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 274 proven. 50 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:29:50,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:29:50,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 1921 states and 2318 transitions. [2018-10-26 23:29:50,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 2318 transitions. [2018-10-26 23:29:50,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-26 23:29:50,930 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:29:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:52,686 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 314 proven. 56 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:29:56,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:29:56,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 1939 states and 2348 transitions. [2018-10-26 23:29:56,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2348 transitions. [2018-10-26 23:29:56,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-26 23:29:56,835 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:29:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:57,073 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 314 proven. 56 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:29:58,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:29:58,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 1965 states and 2374 transitions. [2018-10-26 23:29:58,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2374 transitions. [2018-10-26 23:29:58,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-26 23:29:58,894 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:29:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:59,366 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 314 proven. 56 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:29:59,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:29:59,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 1976 states and 2384 transitions. [2018-10-26 23:29:59,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 2384 transitions. [2018-10-26 23:29:59,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-26 23:29:59,992 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:30:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:30:01,956 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-10-26 23:30:09,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:30:09,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2022 states and 2433 transitions. [2018-10-26 23:30:09,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2433 transitions. [2018-10-26 23:30:09,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-26 23:30:09,219 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:30:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:30:09,544 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-10-26 23:30:11,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:30:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2029 states and 2444 transitions. [2018-10-26 23:30:11,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 2444 transitions. [2018-10-26 23:30:11,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-26 23:30:11,755 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:30:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:30:12,102 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 348 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-10-26 23:30:13,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:30:13,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 2033 states and 2448 transitions. [2018-10-26 23:30:13,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 2448 transitions. [2018-10-26 23:30:13,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-26 23:30:13,415 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:30:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:30:13,727 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 320 proven. 14 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-10-26 23:30:14,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:30:14,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2449 states to 2034 states and 2449 transitions. [2018-10-26 23:30:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2449 transitions. [2018-10-26 23:30:14,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-26 23:30:14,374 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:30:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:30:14,674 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 320 proven. 14 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-10-26 23:30:15,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:30:15,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2038 states and 2453 transitions. [2018-10-26 23:30:15,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2038 states and 2453 transitions. [2018-10-26 23:30:15,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-26 23:30:15,781 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:30:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:30:17,787 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-10-26 23:30:23,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:30:23,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2063 states and 2482 transitions. [2018-10-26 23:30:23,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 2482 transitions. [2018-10-26 23:30:23,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-26 23:30:23,317 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:30:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:30:23,505 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-10-26 23:30:27,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:30:27,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2088 states and 2511 transitions. [2018-10-26 23:30:27,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2511 transitions. [2018-10-26 23:30:27,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-26 23:30:27,971 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:30:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:30:28,141 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-10-26 23:30:28,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:30:28,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2091 states and 2515 transitions. [2018-10-26 23:30:28,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 2515 transitions. [2018-10-26 23:30:28,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-26 23:30:28,926 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:30:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:30:29,252 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-10-26 23:30:29,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:30:29,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2094 states and 2518 transitions. [2018-10-26 23:30:29,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 2518 transitions. [2018-10-26 23:30:29,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-26 23:30:29,696 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:30:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:30:29,846 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-10-26 23:30:30,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:30:30,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2095 states and 2518 transitions. [2018-10-26 23:30:30,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 2518 transitions. [2018-10-26 23:30:30,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-26 23:30:30,275 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:30:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:30:31,369 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 335 proven. 58 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:30:38,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:30:38,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2110 states and 2545 transitions. [2018-10-26 23:30:38,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 2545 transitions. [2018-10-26 23:30:38,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-26 23:30:38,597 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:30:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:30:38,747 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 335 proven. 58 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:30:40,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:30:40,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2124 states and 2559 transitions. [2018-10-26 23:30:40,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 2559 transitions. [2018-10-26 23:30:40,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-26 23:30:40,969 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:30:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:30:41,142 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 335 proven. 58 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:30:41,577 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2018-10-26 23:30:42,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:30:42,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2126 states and 2562 transitions. [2018-10-26 23:30:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 2562 transitions. [2018-10-26 23:30:42,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-26 23:30:42,081 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:30:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:30:42,231 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 335 proven. 58 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-10-26 23:30:42,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-26 23:30:42,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2127 states and 2562 transitions. [2018-10-26 23:30:42,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 2562 transitions. [2018-10-26 23:30:42,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-26 23:30:42,736 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-26 23:30:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:30:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:30:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:30:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 23:30:43,037 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 113 iterations. [2018-10-26 23:30:43,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 26.10 11:30:43 ImpRootNode [2018-10-26 23:30:43,264 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-26 23:30:43,264 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 23:30:43,264 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 23:30:43,264 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 23:30:43,265 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:27:36" (3/4) ... [2018-10-26 23:30:43,268 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 23:30:43,448 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_43445df4-96d6-4827-966f-4097116aea3e/bin-2019/ukojak/witness.graphml [2018-10-26 23:30:43,448 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 23:30:43,449 INFO L168 Benchmark]: Toolchain (without parser) took 192546.04 ms. Allocated memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: 2.4 GB). Free memory was 957.0 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 940.6 MB. Max. memory is 11.5 GB. [2018-10-26 23:30:43,449 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:30:43,450 INFO L168 Benchmark]: CACSL2BoogieTranslator took 544.09 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 927.4 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-10-26 23:30:43,450 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.92 ms. Allocated memory is still 1.0 GB. Free memory was 927.4 MB in the beginning and 919.4 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-10-26 23:30:43,450 INFO L168 Benchmark]: Boogie Preprocessor took 186.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 919.4 MB in the beginning and 1.1 GB in the end (delta: -230.2 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-10-26 23:30:43,450 INFO L168 Benchmark]: RCFGBuilder took 4917.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 922.7 MB in the end (delta: 226.9 MB). Peak memory consumption was 226.9 MB. Max. memory is 11.5 GB. [2018-10-26 23:30:43,451 INFO L168 Benchmark]: CodeCheck took 186635.01 ms. Allocated memory was 1.2 GB in the beginning and 3.4 GB in the end (delta: 2.2 GB). Free memory was 922.7 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 700.5 MB. Max. memory is 11.5 GB. [2018-10-26 23:30:43,454 INFO L168 Benchmark]: Witness Printer took 184.22 ms. Allocated memory is still 3.4 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. [2018-10-26 23:30:43,455 INFO L336 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, 199 locations, 1 error locations. UNSAFE Result, 186.3s OverallTime, 113 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1572967656 SDtfs, -994922876 SDslu, 758029800 SDs, 0 SdLazy, -336927052 SolverSat, 560107864 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 591.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 136049 GetRequests, 130843 SyntacticMatches, 3814 SemanticMatches, 1392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360911 ImplicationChecksByTransitivity, 163.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.6s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 32.3s InterpolantComputationTime, 21006 NumberOfCodeBlocks, 21006 NumberOfCodeBlocksAsserted, 113 NumberOfCheckSat, 20604 ConstructedInterpolants, 0 QuantifiedInterpolants, 29195009 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 112 InterpolantComputations, 82 PerfectInterpolantSequences, 23232/24098 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 392]: 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)) [L591] CALL, EXPR calculate_output(input) [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] RET 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] EXPR calculate_output(input) [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)) [L591] CALL, EXPR calculate_output(input) [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] RET 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] EXPR calculate_output(input) [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)) [L591] CALL, EXPR calculate_output(input) [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] RET 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] EXPR calculate_output(input) [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)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] RET return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [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)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND 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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND TRUE ((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5)) [L262] a16 = 4 [L263] a20 = 0 [L264] RET return 25; VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [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)) [L591] CALL, EXPR calculate_output(input) [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=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND 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=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=1, a20=0, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND TRUE ((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1))))))))) [L239] a20 = 0 [L240] a21 = 1 [L241] a17 = 0 [L242] a8 = 14 [L243] a16 = 4 [L244] RET return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [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)) [L591] CALL calculate_output(input) [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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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=0, a21=1, a7=1, a8=14, 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)))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L391] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L392] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=14, 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 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 544.09 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 927.4 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.92 ms. Allocated memory is still 1.0 GB. Free memory was 927.4 MB in the beginning and 919.4 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 186.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 919.4 MB in the beginning and 1.1 GB in the end (delta: -230.2 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4917.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 922.7 MB in the end (delta: 226.9 MB). Peak memory consumption was 226.9 MB. Max. memory is 11.5 GB. * CodeCheck took 186635.01 ms. Allocated memory was 1.2 GB in the beginning and 3.4 GB in the end (delta: 2.2 GB). Free memory was 922.7 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 700.5 MB. Max. memory is 11.5 GB. * Witness Printer took 184.22 ms. Allocated memory is still 3.4 GB. Free memory was 2.5 GB in the beginning and 2.4 GB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...