./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label15_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_322ec26d-7ce3-4e9c-9a2f-a3c3eec06159/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_322ec26d-7ce3-4e9c-9a2f-a3c3eec06159/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_322ec26d-7ce3-4e9c-9a2f-a3c3eec06159/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_322ec26d-7ce3-4e9c-9a2f-a3c3eec06159/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label15_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_322ec26d-7ce3-4e9c-9a2f-a3c3eec06159/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_322ec26d-7ce3-4e9c-9a2f-a3c3eec06159/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 4893d056c55084f9785b9d10ff20a8939e2b3502 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-27 00:08:22,606 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 00:08:22,609 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 00:08:22,622 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 00:08:22,623 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 00:08:22,624 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 00:08:22,627 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 00:08:22,629 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 00:08:22,633 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 00:08:22,635 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 00:08:22,637 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 00:08:22,637 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 00:08:22,638 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 00:08:22,641 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 00:08:22,649 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 00:08:22,650 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 00:08:22,650 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 00:08:22,652 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 00:08:22,653 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 00:08:22,655 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 00:08:22,656 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 00:08:22,657 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 00:08:22,659 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 00:08:22,659 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 00:08:22,660 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 00:08:22,660 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 00:08:22,661 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 00:08:22,662 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 00:08:22,663 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 00:08:22,664 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 00:08:22,665 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 00:08:22,665 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 00:08:22,666 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 00:08:22,666 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 00:08:22,667 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 00:08:22,668 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 00:08:22,668 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_322ec26d-7ce3-4e9c-9a2f-a3c3eec06159/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-10-27 00:08:22,686 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 00:08:22,686 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 00:08:22,687 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 00:08:22,687 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-27 00:08:22,689 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 00:08:22,690 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 00:08:22,690 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 00:08:22,691 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 00:08:22,691 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 00:08:22,691 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 00:08:22,691 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 00:08:22,691 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 00:08:22,691 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 00:08:22,692 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 00:08:22,692 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 00:08:22,692 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 00:08:22,692 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 00:08:22,692 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-27 00:08:22,692 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-27 00:08:22,693 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 00:08:22,693 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 00:08:22,693 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-27 00:08:22,693 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 00:08:22,693 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 00:08:22,693 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 00:08:22,694 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-27 00:08:22,694 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 00:08:22,694 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 00:08:22,694 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_322ec26d-7ce3-4e9c-9a2f-a3c3eec06159/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 -> 4893d056c55084f9785b9d10ff20a8939e2b3502 [2018-10-27 00:08:22,752 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 00:08:22,771 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 00:08:22,776 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 00:08:22,777 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 00:08:22,777 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 00:08:22,779 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_322ec26d-7ce3-4e9c-9a2f-a3c3eec06159/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label15_false-unreach-call_false-termination.c [2018-10-27 00:08:22,843 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_322ec26d-7ce3-4e9c-9a2f-a3c3eec06159/bin-2019/ukojak/data/559d7d9d2/826e4498c1bb4119ae5fa7ee5a7c35e0/FLAG03f033e2c [2018-10-27 00:08:23,340 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 00:08:23,341 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_322ec26d-7ce3-4e9c-9a2f-a3c3eec06159/sv-benchmarks/c/eca-rers2012/Problem01_label15_false-unreach-call_false-termination.c [2018-10-27 00:08:23,357 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_322ec26d-7ce3-4e9c-9a2f-a3c3eec06159/bin-2019/ukojak/data/559d7d9d2/826e4498c1bb4119ae5fa7ee5a7c35e0/FLAG03f033e2c [2018-10-27 00:08:23,374 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_322ec26d-7ce3-4e9c-9a2f-a3c3eec06159/bin-2019/ukojak/data/559d7d9d2/826e4498c1bb4119ae5fa7ee5a7c35e0 [2018-10-27 00:08:23,378 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 00:08:23,379 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 00:08:23,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 00:08:23,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 00:08:23,385 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 00:08:23,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:08:23" (1/1) ... [2018-10-27 00:08:23,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bca0536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:08:23, skipping insertion in model container [2018-10-27 00:08:23,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:08:23" (1/1) ... [2018-10-27 00:08:23,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 00:08:23,460 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 00:08:23,841 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:08:23,846 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 00:08:24,015 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:08:24,034 INFO L193 MainTranslator]: Completed translation [2018-10-27 00:08:24,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:08:24 WrapperNode [2018-10-27 00:08:24,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 00:08:24,036 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 00:08:24,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 00:08:24,037 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 00:08:24,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:08:24" (1/1) ... [2018-10-27 00:08:24,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:08:24" (1/1) ... [2018-10-27 00:08:24,297 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 00:08:24,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 00:08:24,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 00:08:24,297 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 00:08:24,309 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:08:24" (1/1) ... [2018-10-27 00:08:24,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:08:24" (1/1) ... [2018-10-27 00:08:24,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:08:24" (1/1) ... [2018-10-27 00:08:24,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:08:24" (1/1) ... [2018-10-27 00:08:24,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:08:24" (1/1) ... [2018-10-27 00:08:24,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:08:24" (1/1) ... [2018-10-27 00:08:24,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:08:24" (1/1) ... [2018-10-27 00:08:24,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 00:08:24,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 00:08:24,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 00:08:24,404 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 00:08:24,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:08:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_322ec26d-7ce3-4e9c-9a2f-a3c3eec06159/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-27 00:08:24,478 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-27 00:08:24,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 00:08:24,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 00:08:29,987 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 00:08:29,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:08:29 BoogieIcfgContainer [2018-10-27 00:08:29,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 00:08:29,989 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-27 00:08:29,989 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-27 00:08:30,000 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-27 00:08:30,001 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:08:29" (1/1) ... [2018-10-27 00:08:30,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:08:30,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:30,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 77 states and 146 transitions. [2018-10-27 00:08:30,058 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 146 transitions. [2018-10-27 00:08:30,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-27 00:08:30,064 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:30,618 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-27 00:08:31,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:31,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 147 states and 223 transitions. [2018-10-27 00:08:31,758 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 223 transitions. [2018-10-27 00:08:31,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-27 00:08:31,760 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:31,953 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-27 00:08:32,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 218 states and 317 transitions. [2018-10-27 00:08:32,964 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 317 transitions. [2018-10-27 00:08:32,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-27 00:08:32,969 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:33,231 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-27 00:08:33,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:33,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 224 states and 330 transitions. [2018-10-27 00:08:33,582 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 330 transitions. [2018-10-27 00:08:33,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-27 00:08:33,584 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:34,020 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:08:34,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 295 states and 409 transitions. [2018-10-27 00:08:34,928 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 409 transitions. [2018-10-27 00:08:34,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-27 00:08:34,930 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:35,003 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:08:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:35,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 298 states and 413 transitions. [2018-10-27 00:08:35,032 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 413 transitions. [2018-10-27 00:08:35,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-27 00:08:35,033 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:35,183 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:08:35,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 310 states and 434 transitions. [2018-10-27 00:08:35,538 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 434 transitions. [2018-10-27 00:08:35,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-27 00:08:35,539 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:35,675 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:08:36,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:36,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 323 states and 456 transitions. [2018-10-27 00:08:36,220 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 456 transitions. [2018-10-27 00:08:36,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-27 00:08:36,221 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:36,274 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:08:36,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:36,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 328 states and 466 transitions. [2018-10-27 00:08:36,548 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 466 transitions. [2018-10-27 00:08:36,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-27 00:08:36,550 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:36,719 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:08:37,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:37,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 343 states and 486 transitions. [2018-10-27 00:08:37,704 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 486 transitions. [2018-10-27 00:08:37,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-27 00:08:37,705 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:37,735 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:08:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:37,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 344 states and 488 transitions. [2018-10-27 00:08:37,860 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 488 transitions. [2018-10-27 00:08:37,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-27 00:08:37,861 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:37,889 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:08:38,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:38,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 348 states and 493 transitions. [2018-10-27 00:08:38,154 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 493 transitions. [2018-10-27 00:08:38,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-27 00:08:38,156 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:38,184 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:08:38,601 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-27 00:08:38,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:38,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 353 states and 499 transitions. [2018-10-27 00:08:38,885 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 499 transitions. [2018-10-27 00:08:38,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-27 00:08:38,887 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:38,920 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:08:39,428 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-27 00:08:40,032 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-27 00:08:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 354 states and 501 transitions. [2018-10-27 00:08:40,322 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 501 transitions. [2018-10-27 00:08:40,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-27 00:08:40,328 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:40,372 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:08:40,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:40,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 358 states and 506 transitions. [2018-10-27 00:08:40,527 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 506 transitions. [2018-10-27 00:08:40,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-27 00:08:40,529 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:41,254 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:08:42,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:42,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 369 states and 521 transitions. [2018-10-27 00:08:42,839 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 521 transitions. [2018-10-27 00:08:42,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-27 00:08:42,840 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:42,873 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 00:08:43,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:43,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 383 states and 538 transitions. [2018-10-27 00:08:43,460 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 538 transitions. [2018-10-27 00:08:43,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-27 00:08:43,461 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:43,489 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:08:43,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 390 states and 547 transitions. [2018-10-27 00:08:43,881 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 547 transitions. [2018-10-27 00:08:43,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-27 00:08:43,882 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:08:44,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:44,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 398 states and 557 transitions. [2018-10-27 00:08:44,147 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 557 transitions. [2018-10-27 00:08:44,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-27 00:08:44,149 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:44,177 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:08:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:44,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 399 states and 558 transitions. [2018-10-27 00:08:44,226 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 558 transitions. [2018-10-27 00:08:44,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-27 00:08:44,227 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:44,257 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:08:45,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:45,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 406 states and 565 transitions. [2018-10-27 00:08:45,214 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 565 transitions. [2018-10-27 00:08:45,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-27 00:08:45,216 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:45,418 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:08:45,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:45,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 421 states and 584 transitions. [2018-10-27 00:08:45,953 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 584 transitions. [2018-10-27 00:08:45,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-27 00:08:45,954 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:08:46,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:46,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 422 states and 586 transitions. [2018-10-27 00:08:46,092 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 586 transitions. [2018-10-27 00:08:46,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-27 00:08:46,093 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:46,247 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:08:46,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:46,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 430 states and 595 transitions. [2018-10-27 00:08:46,515 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 595 transitions. [2018-10-27 00:08:46,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-27 00:08:46,516 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:46,636 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-27 00:08:46,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:46,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 440 states and 609 transitions. [2018-10-27 00:08:46,854 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 609 transitions. [2018-10-27 00:08:46,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-27 00:08:46,855 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:46,887 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:08:47,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:47,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 441 states and 611 transitions. [2018-10-27 00:08:47,030 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 611 transitions. [2018-10-27 00:08:47,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-27 00:08:47,031 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:47,076 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:08:48,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:48,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 458 states and 629 transitions. [2018-10-27 00:08:48,034 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 629 transitions. [2018-10-27 00:08:48,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-27 00:08:48,036 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:48,137 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 00:08:48,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:48,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 459 states and 631 transitions. [2018-10-27 00:08:48,281 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 631 transitions. [2018-10-27 00:08:48,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-27 00:08:48,282 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:48,310 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-27 00:08:48,740 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-27 00:08:49,183 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-27 00:08:49,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:49,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 460 states and 633 transitions. [2018-10-27 00:08:49,876 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 633 transitions. [2018-10-27 00:08:49,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-27 00:08:49,877 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:49,921 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:08:50,848 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-27 00:08:51,812 WARN L179 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-10-27 00:08:53,537 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-27 00:08:54,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:54,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 477 states and 651 transitions. [2018-10-27 00:08:54,441 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 651 transitions. [2018-10-27 00:08:54,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-27 00:08:54,442 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:54,468 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-27 00:08:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 479 states and 653 transitions. [2018-10-27 00:08:54,609 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 653 transitions. [2018-10-27 00:08:54,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-27 00:08:54,610 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:54,664 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:08:55,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:55,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 484 states and 659 transitions. [2018-10-27 00:08:55,518 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 659 transitions. [2018-10-27 00:08:55,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-27 00:08:55,519 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:55,717 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:08:56,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:56,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 498 states and 673 transitions. [2018-10-27 00:08:56,355 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 673 transitions. [2018-10-27 00:08:56,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-27 00:08:56,355 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:56,380 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-27 00:08:56,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:56,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 503 states and 678 transitions. [2018-10-27 00:08:56,437 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 678 transitions. [2018-10-27 00:08:56,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-27 00:08:56,438 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:56,473 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-27 00:08:56,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:56,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 508 states and 684 transitions. [2018-10-27 00:08:56,885 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 684 transitions. [2018-10-27 00:08:56,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-27 00:08:56,886 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:56,927 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 00:08:56,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 516 states and 692 transitions. [2018-10-27 00:08:56,970 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 692 transitions. [2018-10-27 00:08:56,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-27 00:08:56,971 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:57,615 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-27 00:08:59,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:59,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 547 states and 728 transitions. [2018-10-27 00:08:59,324 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 728 transitions. [2018-10-27 00:08:59,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-27 00:08:59,325 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 00:08:59,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:08:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 548 states and 729 transitions. [2018-10-27 00:08:59,425 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 729 transitions. [2018-10-27 00:08:59,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-27 00:08:59,426 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:08:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:08:59,920 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:09:01,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:01,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 556 states and 744 transitions. [2018-10-27 00:09:01,448 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 744 transitions. [2018-10-27 00:09:01,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-27 00:09:01,449 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:01,559 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:09:02,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:02,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 562 states and 752 transitions. [2018-10-27 00:09:02,144 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 752 transitions. [2018-10-27 00:09:02,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-27 00:09:02,146 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:02,257 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:09:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:02,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 566 states and 757 transitions. [2018-10-27 00:09:02,816 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 757 transitions. [2018-10-27 00:09:02,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-27 00:09:02,817 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:02,922 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:09:03,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:03,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 580 states and 772 transitions. [2018-10-27 00:09:03,892 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 772 transitions. [2018-10-27 00:09:03,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-27 00:09:03,893 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-27 00:09:05,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:05,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 583 states and 777 transitions. [2018-10-27 00:09:05,045 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 777 transitions. [2018-10-27 00:09:05,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-27 00:09:05,046 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:05,098 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-27 00:09:05,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:05,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 600 states and 795 transitions. [2018-10-27 00:09:05,716 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 795 transitions. [2018-10-27 00:09:05,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-27 00:09:05,717 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:05,811 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-27 00:09:06,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:06,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 601 states and 798 transitions. [2018-10-27 00:09:06,067 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 798 transitions. [2018-10-27 00:09:06,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-27 00:09:06,068 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:06,104 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-27 00:09:06,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:06,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 610 states and 808 transitions. [2018-10-27 00:09:06,169 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 808 transitions. [2018-10-27 00:09:06,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-27 00:09:06,170 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:06,213 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 00:09:06,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:06,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 619 states and 817 transitions. [2018-10-27 00:09:06,611 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 817 transitions. [2018-10-27 00:09:06,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-27 00:09:06,612 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:06,646 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-27 00:09:07,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:07,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 631 states and 832 transitions. [2018-10-27 00:09:07,189 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 832 transitions. [2018-10-27 00:09:07,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-27 00:09:07,190 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:07,404 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 00:09:09,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:09,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 768 states and 980 transitions. [2018-10-27 00:09:09,522 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 980 transitions. [2018-10-27 00:09:09,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-27 00:09:09,523 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:09,565 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 00:09:09,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:09,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 769 states and 981 transitions. [2018-10-27 00:09:09,591 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 981 transitions. [2018-10-27 00:09:09,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-27 00:09:09,592 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:09,635 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 00:09:09,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:09,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 782 states and 994 transitions. [2018-10-27 00:09:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 994 transitions. [2018-10-27 00:09:09,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-27 00:09:09,810 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:09,850 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 00:09:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:09,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 783 states and 995 transitions. [2018-10-27 00:09:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 995 transitions. [2018-10-27 00:09:09,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-27 00:09:09,954 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:10,691 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-27 00:09:12,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:12,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 825 states and 1039 transitions. [2018-10-27 00:09:12,543 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1039 transitions. [2018-10-27 00:09:12,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-27 00:09:12,544 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:13,039 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 00:09:13,914 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-10-27 00:09:16,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 882 states and 1113 transitions. [2018-10-27 00:09:16,921 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1113 transitions. [2018-10-27 00:09:16,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-27 00:09:16,923 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 00:09:18,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:18,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 905 states and 1139 transitions. [2018-10-27 00:09:18,648 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1139 transitions. [2018-10-27 00:09:18,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-27 00:09:18,649 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:18,822 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 00:09:19,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:19,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 914 states and 1149 transitions. [2018-10-27 00:09:19,268 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1149 transitions. [2018-10-27 00:09:19,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-27 00:09:19,270 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 00:09:20,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:20,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 918 states and 1155 transitions. [2018-10-27 00:09:20,465 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1155 transitions. [2018-10-27 00:09:20,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-27 00:09:20,466 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:20,641 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 00:09:20,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 925 states and 1161 transitions. [2018-10-27 00:09:20,837 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1161 transitions. [2018-10-27 00:09:20,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-27 00:09:20,839 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:21,178 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 00:09:21,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:21,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 930 states and 1169 transitions. [2018-10-27 00:09:21,727 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1169 transitions. [2018-10-27 00:09:21,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-27 00:09:21,728 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:21,758 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-27 00:09:22,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:22,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 951 states and 1193 transitions. [2018-10-27 00:09:22,838 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1193 transitions. [2018-10-27 00:09:22,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-27 00:09:22,839 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:23,078 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-27 00:09:24,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:24,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 997 states and 1245 transitions. [2018-10-27 00:09:24,123 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1245 transitions. [2018-10-27 00:09:24,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-27 00:09:24,124 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:24,172 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-27 00:09:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1010 states and 1257 transitions. [2018-10-27 00:09:24,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1257 transitions. [2018-10-27 00:09:24,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-27 00:09:24,631 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:24,707 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-27 00:09:24,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:24,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1015 states and 1264 transitions. [2018-10-27 00:09:24,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1264 transitions. [2018-10-27 00:09:24,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-27 00:09:24,849 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:24,885 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 00:09:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1022 states and 1271 transitions. [2018-10-27 00:09:24,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1271 transitions. [2018-10-27 00:09:24,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-27 00:09:24,932 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 00:09:25,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:25,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1029 states and 1279 transitions. [2018-10-27 00:09:25,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1279 transitions. [2018-10-27 00:09:25,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-27 00:09:25,248 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:25,285 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 00:09:25,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:25,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1035 states and 1286 transitions. [2018-10-27 00:09:25,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1286 transitions. [2018-10-27 00:09:25,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-27 00:09:25,607 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:25,634 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-27 00:09:25,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:25,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1044 states and 1297 transitions. [2018-10-27 00:09:25,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1297 transitions. [2018-10-27 00:09:25,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-27 00:09:25,699 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:25,746 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 00:09:26,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:26,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1060 states and 1322 transitions. [2018-10-27 00:09:26,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1322 transitions. [2018-10-27 00:09:26,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-27 00:09:26,838 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:26,915 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 00:09:27,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:27,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1066 states and 1332 transitions. [2018-10-27 00:09:27,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1332 transitions. [2018-10-27 00:09:27,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-27 00:09:27,945 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:27,994 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 00:09:29,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:29,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1083 states and 1350 transitions. [2018-10-27 00:09:29,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1350 transitions. [2018-10-27 00:09:29,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-27 00:09:29,261 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:29,338 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 00:09:30,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:30,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1088 states and 1355 transitions. [2018-10-27 00:09:30,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1355 transitions. [2018-10-27 00:09:30,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-27 00:09:30,164 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:30,233 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 00:09:31,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:31,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1097 states and 1365 transitions. [2018-10-27 00:09:31,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1365 transitions. [2018-10-27 00:09:31,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-27 00:09:31,090 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:32,046 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 167 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:09:33,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:33,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1113 states and 1387 transitions. [2018-10-27 00:09:33,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1387 transitions. [2018-10-27 00:09:33,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-27 00:09:33,953 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 167 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:09:35,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:35,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1129 states and 1408 transitions. [2018-10-27 00:09:35,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1408 transitions. [2018-10-27 00:09:35,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-27 00:09:35,916 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:36,019 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 167 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:09:36,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:36,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1136 states and 1414 transitions. [2018-10-27 00:09:36,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1414 transitions. [2018-10-27 00:09:36,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-27 00:09:36,559 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:36,603 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 00:09:36,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:36,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1147 states and 1425 transitions. [2018-10-27 00:09:36,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1425 transitions. [2018-10-27 00:09:36,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-27 00:09:36,660 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:36,715 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-10-27 00:09:36,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:36,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1148 states and 1426 transitions. [2018-10-27 00:09:36,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1426 transitions. [2018-10-27 00:09:36,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-27 00:09:36,807 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:36,867 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 00:09:36,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:36,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1160 states and 1439 transitions. [2018-10-27 00:09:36,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1439 transitions. [2018-10-27 00:09:36,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-27 00:09:36,991 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:37,048 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 00:09:37,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:37,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1165 states and 1447 transitions. [2018-10-27 00:09:37,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1447 transitions. [2018-10-27 00:09:37,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-27 00:09:37,833 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:38,519 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:09:41,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:41,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1176 states and 1466 transitions. [2018-10-27 00:09:41,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1466 transitions. [2018-10-27 00:09:41,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-27 00:09:41,424 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:41,632 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:09:43,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:43,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1183 states and 1475 transitions. [2018-10-27 00:09:43,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1475 transitions. [2018-10-27 00:09:43,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-27 00:09:43,032 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:43,115 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:09:43,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:43,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1192 states and 1485 transitions. [2018-10-27 00:09:43,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1485 transitions. [2018-10-27 00:09:43,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-27 00:09:43,752 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:44,070 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 160 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:09:47,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:47,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1267 states and 1575 transitions. [2018-10-27 00:09:47,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1575 transitions. [2018-10-27 00:09:47,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-27 00:09:47,024 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:47,130 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 160 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:09:48,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:48,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1280 states and 1589 transitions. [2018-10-27 00:09:48,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1589 transitions. [2018-10-27 00:09:48,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-27 00:09:48,479 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:48,585 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-27 00:09:49,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1306 states and 1622 transitions. [2018-10-27 00:09:49,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1622 transitions. [2018-10-27 00:09:49,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-27 00:09:49,846 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:49,916 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-27 00:09:50,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:50,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1313 states and 1630 transitions. [2018-10-27 00:09:50,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1630 transitions. [2018-10-27 00:09:50,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-27 00:09:50,903 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:50,959 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-27 00:09:51,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:51,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1317 states and 1635 transitions. [2018-10-27 00:09:51,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1635 transitions. [2018-10-27 00:09:51,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-27 00:09:51,410 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:51,462 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-27 00:09:51,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1321 states and 1641 transitions. [2018-10-27 00:09:51,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1641 transitions. [2018-10-27 00:09:51,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-27 00:09:51,981 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:52,031 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-27 00:09:52,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:52,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1326 states and 1646 transitions. [2018-10-27 00:09:52,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1646 transitions. [2018-10-27 00:09:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-27 00:09:52,438 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:52,502 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-27 00:09:53,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:53,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1331 states and 1655 transitions. [2018-10-27 00:09:53,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1655 transitions. [2018-10-27 00:09:53,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-27 00:09:53,354 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:53,414 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-27 00:09:55,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:55,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1348 states and 1682 transitions. [2018-10-27 00:09:55,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1682 transitions. [2018-10-27 00:09:55,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-27 00:09:55,035 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:55,144 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-27 00:09:55,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:55,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1362 states and 1696 transitions. [2018-10-27 00:09:55,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1696 transitions. [2018-10-27 00:09:55,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-27 00:09:55,708 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:55,784 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-27 00:09:57,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:57,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1371 states and 1712 transitions. [2018-10-27 00:09:57,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1712 transitions. [2018-10-27 00:09:57,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-27 00:09:57,344 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:57,396 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-27 00:09:57,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:57,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1375 states and 1719 transitions. [2018-10-27 00:09:57,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1719 transitions. [2018-10-27 00:09:57,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-27 00:09:57,842 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:57,897 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-27 00:09:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:09:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1390 states and 1735 transitions. [2018-10-27 00:09:59,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1735 transitions. [2018-10-27 00:09:59,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-27 00:09:59,475 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:09:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:09:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-27 00:10:00,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:10:00,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1395 states and 1741 transitions. [2018-10-27 00:10:00,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1741 transitions. [2018-10-27 00:10:00,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-27 00:10:00,036 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:10:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:10:00,868 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-10-27 00:10:02,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:10:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1426 states and 1778 transitions. [2018-10-27 00:10:02,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1778 transitions. [2018-10-27 00:10:02,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-27 00:10:02,695 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:10:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:10:02,773 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-27 00:10:03,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:10:03,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1451 states and 1805 transitions. [2018-10-27 00:10:03,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1805 transitions. [2018-10-27 00:10:03,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-27 00:10:03,336 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:10:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:10:03,377 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-27 00:10:04,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:10:04,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1456 states and 1810 transitions. [2018-10-27 00:10:04,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1810 transitions. [2018-10-27 00:10:04,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-27 00:10:04,022 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:10:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:10:04,072 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-27 00:10:04,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:10:04,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1461 states and 1815 transitions. [2018-10-27 00:10:04,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 1815 transitions. [2018-10-27 00:10:04,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-27 00:10:04,843 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:10:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:10:04,879 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-27 00:10:05,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:10:05,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1472 states and 1827 transitions. [2018-10-27 00:10:05,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 1827 transitions. [2018-10-27 00:10:05,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-27 00:10:05,713 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:10:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:10:05,758 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-27 00:10:06,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:10:06,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1475 states and 1830 transitions. [2018-10-27 00:10:06,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1830 transitions. [2018-10-27 00:10:06,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-27 00:10:06,355 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:10:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:10:06,399 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-27 00:10:06,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:10:06,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1480 states and 1837 transitions. [2018-10-27 00:10:06,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1837 transitions. [2018-10-27 00:10:06,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-27 00:10:06,714 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:10:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:10:07,908 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-10-27 00:10:10,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:10:10,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1503 states and 1866 transitions. [2018-10-27 00:10:10,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1866 transitions. [2018-10-27 00:10:10,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-27 00:10:10,055 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:10:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:10:11,006 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 258 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-27 00:10:13,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:10:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1524 states and 1890 transitions. [2018-10-27 00:10:13,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1890 transitions. [2018-10-27 00:10:13,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-27 00:10:13,615 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:10:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:10:13,720 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-27 00:10:15,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:10:15,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1534 states and 1903 transitions. [2018-10-27 00:10:15,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 1903 transitions. [2018-10-27 00:10:15,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-27 00:10:15,186 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:10:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:10:15,252 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-27 00:10:16,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:10:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1549 states and 1919 transitions. [2018-10-27 00:10:16,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 1919 transitions. [2018-10-27 00:10:16,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-27 00:10:16,305 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:10:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:10:16,341 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-27 00:10:16,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:10:16,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1553 states and 1924 transitions. [2018-10-27 00:10:16,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 1924 transitions. [2018-10-27 00:10:16,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-27 00:10:16,704 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:10:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:10:16,767 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-27 00:10:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:10:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1559 states and 1929 transitions. [2018-10-27 00:10:17,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 1929 transitions. [2018-10-27 00:10:17,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-27 00:10:17,806 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:10:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:10:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-27 00:10:18,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:10:18,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1564 states and 1935 transitions. [2018-10-27 00:10:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1935 transitions. [2018-10-27 00:10:18,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-27 00:10:18,681 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:10:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:10:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-27 00:10:19,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:10:19,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1575 states and 1946 transitions. [2018-10-27 00:10:19,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 1946 transitions. [2018-10-27 00:10:19,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-27 00:10:19,788 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:10:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:10:21,399 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-10-27 00:10:24,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:10:24,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1606 states and 1982 transitions. [2018-10-27 00:10:24,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1982 transitions. [2018-10-27 00:10:24,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-27 00:10:24,542 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:10:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:10:24,709 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-10-27 00:10:26,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-27 00:10:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1623 states and 1999 transitions. [2018-10-27 00:10:26,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 1999 transitions. [2018-10-27 00:10:26,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-27 00:10:26,651 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-27 00:10:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 00:10:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 00:10:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 00:10:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 00:10:26,919 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 113 iterations. [2018-10-27 00:10:27,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 27.10 12:10:27 ImpRootNode [2018-10-27 00:10:27,079 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-10-27 00:10:27,079 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 00:10:27,079 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 00:10:27,080 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 00:10:27,080 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:08:29" (3/4) ... [2018-10-27 00:10:27,089 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-27 00:10:27,270 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_322ec26d-7ce3-4e9c-9a2f-a3c3eec06159/bin-2019/ukojak/witness.graphml [2018-10-27 00:10:27,270 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 00:10:27,271 INFO L168 Benchmark]: Toolchain (without parser) took 123892.18 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 950.4 MB in the beginning and 1.8 GB in the end (delta: -845.1 MB). Peak memory consumption was 594.6 MB. Max. memory is 11.5 GB. [2018-10-27 00:10:27,271 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 00:10:27,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 655.63 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 920.9 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-10-27 00:10:27,273 INFO L168 Benchmark]: Boogie Procedure Inliner took 260.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 920.9 MB in the beginning and 1.2 GB in the end (delta: -250.0 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2018-10-27 00:10:27,273 INFO L168 Benchmark]: Boogie Preprocessor took 105.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-10-27 00:10:27,274 INFO L168 Benchmark]: RCFGBuilder took 5585.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 939.0 MB in the end (delta: 225.3 MB). Peak memory consumption was 225.3 MB. Max. memory is 11.5 GB. [2018-10-27 00:10:27,275 INFO L168 Benchmark]: CodeCheck took 117090.00 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 939.0 MB in the beginning and 1.8 GB in the end (delta: -886.5 MB). Peak memory consumption was 372.8 MB. Max. memory is 11.5 GB. [2018-10-27 00:10:27,275 INFO L168 Benchmark]: Witness Printer took 190.65 ms. Allocated memory is still 2.5 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2018-10-27 00:10:27,277 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, 116.8s OverallTime, 113 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1159360096 SDtfs, -1543572288 SDslu, 1909314352 SDs, 0 SdLazy, 1170428620 SolverSat, -1081017796 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 675.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 112337 GetRequests, 108025 SyntacticMatches, 3410 SemanticMatches, 902 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538793 ImplicationChecksByTransitivity, 96.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.5s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 16906 NumberOfCodeBlocks, 16906 NumberOfCodeBlocksAsserted, 113 NumberOfCheckSat, 16573 ConstructedInterpolants, 0 QuantifiedInterpolants, 11069093 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 112 InterpolantComputations, 85 PerfectInterpolantSequences, 13041/13355 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: 419]: 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 FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND TRUE ((((((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)) [L179] a17 = 0 [L180] a16 = 5 [L181] a21 = 1 [L182] a8 = 14 [L183] a7 = 1 [L184] a20 = 1 [L185] RET return -1; VAL [a=1, a12=8, a16=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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=5, a17=0, a20=1, 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)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L412] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L415] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=1, 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] [L418] COND TRUE ((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [a=1, a12=8, a16=5, a17=0, a20=1, 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] [L419] __VERIFIER_error() VAL [a=1, a12=8, a16=5, a17=0, a20=1, 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 655.63 ms. Allocated memory is still 1.0 GB. Free memory was 950.4 MB in the beginning and 920.9 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 260.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 920.9 MB in the beginning and 1.2 GB in the end (delta: -250.0 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 105.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5585.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 939.0 MB in the end (delta: 225.3 MB). Peak memory consumption was 225.3 MB. Max. memory is 11.5 GB. * CodeCheck took 117090.00 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 939.0 MB in the beginning and 1.8 GB in the end (delta: -886.5 MB). Peak memory consumption was 372.8 MB. Max. memory is 11.5 GB. * Witness Printer took 190.65 ms. Allocated memory is still 2.5 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...