./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_6d873cc0-424b-4b62-b3d9-c7b59684683b/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6d873cc0-424b-4b62-b3d9-c7b59684683b/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6d873cc0-424b-4b62-b3d9-c7b59684683b/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6d873cc0-424b-4b62-b3d9-c7b59684683b/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_6d873cc0-424b-4b62-b3d9-c7b59684683b/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6d873cc0-424b-4b62-b3d9-c7b59684683b/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-11-10 04:51:20,164 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:51:20,165 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:51:20,172 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:51:20,172 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:51:20,173 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:51:20,174 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:51:20,175 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:51:20,176 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:51:20,176 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:51:20,177 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:51:20,177 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:51:20,178 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:51:20,179 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:51:20,179 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:51:20,180 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:51:20,181 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:51:20,182 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:51:20,183 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:51:20,184 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:51:20,185 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:51:20,186 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:51:20,187 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:51:20,188 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:51:20,188 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:51:20,188 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:51:20,189 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:51:20,190 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:51:20,190 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:51:20,191 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:51:20,191 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:51:20,192 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:51:20,192 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:51:20,192 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:51:20,193 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:51:20,193 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:51:20,193 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6d873cc0-424b-4b62-b3d9-c7b59684683b/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 04:51:20,203 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:51:20,204 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:51:20,204 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 04:51:20,204 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 04:51:20,205 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 04:51:20,205 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 04:51:20,205 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:51:20,205 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:51:20,206 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:51:20,206 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:51:20,206 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:51:20,206 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 04:51:20,206 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 04:51:20,206 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 04:51:20,206 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:51:20,207 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:51:20,207 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 04:51:20,207 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 04:51:20,207 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 04:51:20,207 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:51:20,207 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 04:51:20,207 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 04:51:20,208 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:51:20,208 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 04:51:20,208 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 04:51:20,208 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 04:51:20,208 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 04:51:20,208 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 04:51:20,208 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_6d873cc0-424b-4b62-b3d9-c7b59684683b/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-11-10 04:51:20,229 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:51:20,237 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:51:20,239 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:51:20,239 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:51:20,240 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:51:20,240 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6d873cc0-424b-4b62-b3d9-c7b59684683b/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label15_false-unreach-call_false-termination.c [2018-11-10 04:51:20,276 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6d873cc0-424b-4b62-b3d9-c7b59684683b/bin-2019/ukojak/data/8d6d91ca9/2f89572e1e6a41fa8af08585cbb7afbc/FLAG8da48671b [2018-11-10 04:51:20,716 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:51:20,716 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6d873cc0-424b-4b62-b3d9-c7b59684683b/sv-benchmarks/c/eca-rers2012/Problem01_label15_false-unreach-call_false-termination.c [2018-11-10 04:51:20,725 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6d873cc0-424b-4b62-b3d9-c7b59684683b/bin-2019/ukojak/data/8d6d91ca9/2f89572e1e6a41fa8af08585cbb7afbc/FLAG8da48671b [2018-11-10 04:51:20,737 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6d873cc0-424b-4b62-b3d9-c7b59684683b/bin-2019/ukojak/data/8d6d91ca9/2f89572e1e6a41fa8af08585cbb7afbc [2018-11-10 04:51:20,740 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:51:20,741 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:51:20,741 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:51:20,741 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:51:20,744 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:51:20,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:51:20" (1/1) ... [2018-11-10 04:51:20,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e7f328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:51:20, skipping insertion in model container [2018-11-10 04:51:20,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:51:20" (1/1) ... [2018-11-10 04:51:20,753 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:51:20,787 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:51:21,016 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:51:21,019 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:51:21,085 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:51:21,097 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:51:21,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:51:21 WrapperNode [2018-11-10 04:51:21,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:51:21,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:51:21,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:51:21,098 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:51:21,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:51:21" (1/1) ... [2018-11-10 04:51:21,119 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:51:21" (1/1) ... [2018-11-10 04:51:21,200 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:51:21,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:51:21,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:51:21,200 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:51:21,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:51:21" (1/1) ... [2018-11-10 04:51:21,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:51:21" (1/1) ... [2018-11-10 04:51:21,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:51:21" (1/1) ... [2018-11-10 04:51:21,211 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:51:21" (1/1) ... [2018-11-10 04:51:21,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:51:21" (1/1) ... [2018-11-10 04:51:21,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:51:21" (1/1) ... [2018-11-10 04:51:21,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:51:21" (1/1) ... [2018-11-10 04:51:21,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:51:21,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:51:21,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:51:21,242 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:51:21,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:51:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6d873cc0-424b-4b62-b3d9-c7b59684683b/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-11-10 04:51:21,284 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 04:51:21,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:51:21,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:51:22,548 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:51:22,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:51:22 BoogieIcfgContainer [2018-11-10 04:51:22,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:51:22,549 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 04:51:22,549 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 04:51:22,557 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 04:51:22,557 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:51:22" (1/1) ... [2018-11-10 04:51:22,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:51:22,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:22,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 77 states and 146 transitions. [2018-11-10 04:51:22,590 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 146 transitions. [2018-11-10 04:51:22,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 04:51:22,593 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:22,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:23,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:23,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 147 states and 223 transitions. [2018-11-10 04:51:23,355 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 223 transitions. [2018-11-10 04:51:23,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 04:51:23,356 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:23,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:23,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:23,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 218 states and 317 transitions. [2018-11-10 04:51:23,861 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 317 transitions. [2018-11-10 04:51:23,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 04:51:23,864 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:23,931 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:24,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:24,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 224 states and 330 transitions. [2018-11-10 04:51:24,024 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 330 transitions. [2018-11-10 04:51:24,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 04:51:24,029 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:24,100 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:24,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:24,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 295 states and 409 transitions. [2018-11-10 04:51:24,600 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 409 transitions. [2018-11-10 04:51:24,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 04:51:24,602 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:24,641 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:24,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:24,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 298 states and 413 transitions. [2018-11-10 04:51:24,662 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 413 transitions. [2018-11-10 04:51:24,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 04:51:24,663 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:24,703 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:24,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:24,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 310 states and 434 transitions. [2018-11-10 04:51:24,955 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 434 transitions. [2018-11-10 04:51:24,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 04:51:24,956 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:25,006 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:25,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:25,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 323 states and 456 transitions. [2018-11-10 04:51:25,323 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 456 transitions. [2018-11-10 04:51:25,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 04:51:25,324 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:25,345 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:25,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:25,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 324 states and 458 transitions. [2018-11-10 04:51:25,453 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 458 transitions. [2018-11-10 04:51:25,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 04:51:25,454 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:25,483 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:25,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:25,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 328 states and 466 transitions. [2018-11-10 04:51:25,568 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 466 transitions. [2018-11-10 04:51:25,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 04:51:25,569 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:25,724 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:26,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:26,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 343 states and 486 transitions. [2018-11-10 04:51:26,343 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 486 transitions. [2018-11-10 04:51:26,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 04:51:26,344 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:26,372 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:51:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:26,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 344 states and 488 transitions. [2018-11-10 04:51:26,485 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 488 transitions. [2018-11-10 04:51:26,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 04:51:26,487 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:26,507 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:51:26,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:26,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 348 states and 493 transitions. [2018-11-10 04:51:26,625 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 493 transitions. [2018-11-10 04:51:26,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 04:51:26,626 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:26,645 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:26,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:26,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 353 states and 499 transitions. [2018-11-10 04:51:26,887 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 499 transitions. [2018-11-10 04:51:26,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 04:51:26,888 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:26,911 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:51:27,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:27,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 354 states and 501 transitions. [2018-11-10 04:51:27,071 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 501 transitions. [2018-11-10 04:51:27,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 04:51:27,073 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:51:27,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:27,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 358 states and 506 transitions. [2018-11-10 04:51:27,199 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 506 transitions. [2018-11-10 04:51:27,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 04:51:27,200 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:27,312 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:28,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:28,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 369 states and 521 transitions. [2018-11-10 04:51:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 521 transitions. [2018-11-10 04:51:28,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 04:51:28,060 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:28,100 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 04:51:28,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:28,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 383 states and 538 transitions. [2018-11-10 04:51:28,392 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 538 transitions. [2018-11-10 04:51:28,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-10 04:51:28,393 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:28,412 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:28,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:28,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 390 states and 547 transitions. [2018-11-10 04:51:28,547 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 547 transitions. [2018-11-10 04:51:28,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-10 04:51:28,548 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:28,569 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:28,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 398 states and 557 transitions. [2018-11-10 04:51:28,713 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 557 transitions. [2018-11-10 04:51:28,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 04:51:28,713 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:28,732 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:28,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:28,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 399 states and 558 transitions. [2018-11-10 04:51:28,741 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 558 transitions. [2018-11-10 04:51:28,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 04:51:28,742 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:28,758 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:51:28,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:28,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 406 states and 565 transitions. [2018-11-10 04:51:28,895 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 565 transitions. [2018-11-10 04:51:28,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 04:51:28,895 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:29,027 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:29,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:29,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 421 states and 584 transitions. [2018-11-10 04:51:29,357 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 584 transitions. [2018-11-10 04:51:29,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-10 04:51:29,358 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:29,383 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:29,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:29,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 422 states and 586 transitions. [2018-11-10 04:51:29,400 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 586 transitions. [2018-11-10 04:51:29,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-10 04:51:29,401 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:29,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:29,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 430 states and 595 transitions. [2018-11-10 04:51:29,672 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 595 transitions. [2018-11-10 04:51:29,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 04:51:29,672 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:29,774 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 04:51:29,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:29,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 440 states and 609 transitions. [2018-11-10 04:51:29,953 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 609 transitions. [2018-11-10 04:51:29,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 04:51:29,953 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:29,978 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:29,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 441 states and 611 transitions. [2018-11-10 04:51:29,994 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 611 transitions. [2018-11-10 04:51:29,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 04:51:29,995 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:30,025 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:51:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:30,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 458 states and 629 transitions. [2018-11-10 04:51:30,510 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 629 transitions. [2018-11-10 04:51:30,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 04:51:30,510 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 04:51:30,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:30,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 459 states and 631 transitions. [2018-11-10 04:51:30,565 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 631 transitions. [2018-11-10 04:51:30,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 04:51:30,566 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:30,586 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 04:51:30,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:30,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 460 states and 633 transitions. [2018-11-10 04:51:30,733 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 633 transitions. [2018-11-10 04:51:30,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 04:51:30,734 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:30,763 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:31,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:31,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 477 states and 651 transitions. [2018-11-10 04:51:31,216 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 651 transitions. [2018-11-10 04:51:31,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 04:51:31,217 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:31,236 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 04:51:31,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:31,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 479 states and 653 transitions. [2018-11-10 04:51:31,259 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 653 transitions. [2018-11-10 04:51:31,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 04:51:31,260 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:31,317 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:31,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:31,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 484 states and 659 transitions. [2018-11-10 04:51:31,648 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 659 transitions. [2018-11-10 04:51:31,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-10 04:51:31,648 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:31,811 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:32,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:32,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 498 states and 673 transitions. [2018-11-10 04:51:32,242 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 673 transitions. [2018-11-10 04:51:32,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 04:51:32,243 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:32,257 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 04:51:32,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:32,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 503 states and 678 transitions. [2018-11-10 04:51:32,290 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 678 transitions. [2018-11-10 04:51:32,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-10 04:51:32,291 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:32,309 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 04:51:32,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 508 states and 684 transitions. [2018-11-10 04:51:32,518 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 684 transitions. [2018-11-10 04:51:32,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 04:51:32,519 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:32,543 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 04:51:32,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:32,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 516 states and 692 transitions. [2018-11-10 04:51:32,571 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 692 transitions. [2018-11-10 04:51:32,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 04:51:32,571 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:32,721 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 04:51:33,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:33,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 547 states and 728 transitions. [2018-11-10 04:51:33,996 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 728 transitions. [2018-11-10 04:51:33,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-10 04:51:33,996 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:34,019 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 04:51:34,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:34,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 548 states and 729 transitions. [2018-11-10 04:51:34,046 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 729 transitions. [2018-11-10 04:51:34,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 04:51:34,046 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:34,376 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:35,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:35,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 560 states and 749 transitions. [2018-11-10 04:51:35,466 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 749 transitions. [2018-11-10 04:51:35,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 04:51:35,466 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:35,546 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:35,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:35,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 566 states and 757 transitions. [2018-11-10 04:51:35,883 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 757 transitions. [2018-11-10 04:51:35,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 04:51:35,884 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:35,957 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:36,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:36,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 571 states and 763 transitions. [2018-11-10 04:51:36,111 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 763 transitions. [2018-11-10 04:51:36,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 04:51:36,112 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:36,179 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:36,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:36,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 580 states and 772 transitions. [2018-11-10 04:51:36,394 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 772 transitions. [2018-11-10 04:51:36,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 04:51:36,395 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:36,420 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 04:51:36,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:36,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 583 states and 777 transitions. [2018-11-10 04:51:36,781 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 777 transitions. [2018-11-10 04:51:36,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 04:51:36,781 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:36,805 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 04:51:37,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:37,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 600 states and 795 transitions. [2018-11-10 04:51:37,248 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 795 transitions. [2018-11-10 04:51:37,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 04:51:37,249 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:37,288 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-10 04:51:37,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:37,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 601 states and 798 transitions. [2018-11-10 04:51:37,313 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 798 transitions. [2018-11-10 04:51:37,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 04:51:37,314 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:37,332 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 04:51:37,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:37,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 610 states and 808 transitions. [2018-11-10 04:51:37,370 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 808 transitions. [2018-11-10 04:51:37,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-10 04:51:37,370 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:37,389 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 04:51:37,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:37,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 619 states and 817 transitions. [2018-11-10 04:51:37,416 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 817 transitions. [2018-11-10 04:51:37,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-10 04:51:37,417 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:37,436 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 04:51:37,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:37,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 631 states and 832 transitions. [2018-11-10 04:51:37,620 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 832 transitions. [2018-11-10 04:51:37,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 04:51:37,621 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:37,673 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 04:51:38,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:38,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 768 states and 980 transitions. [2018-11-10 04:51:38,927 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 980 transitions. [2018-11-10 04:51:38,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 04:51:38,928 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 04:51:38,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:38,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 769 states and 981 transitions. [2018-11-10 04:51:38,986 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 981 transitions. [2018-11-10 04:51:38,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-10 04:51:38,987 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:39,016 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 04:51:39,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:39,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 782 states and 994 transitions. [2018-11-10 04:51:39,119 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 994 transitions. [2018-11-10 04:51:39,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-10 04:51:39,120 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:39,140 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 04:51:39,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:39,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 783 states and 995 transitions. [2018-11-10 04:51:39,156 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 995 transitions. [2018-11-10 04:51:39,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-10 04:51:39,157 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:39,405 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 04:51:40,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:40,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 825 states and 1039 transitions. [2018-11-10 04:51:40,461 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1039 transitions. [2018-11-10 04:51:40,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-10 04:51:40,462 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:40,665 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 04:51:43,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:43,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 886 states and 1122 transitions. [2018-11-10 04:51:43,244 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1122 transitions. [2018-11-10 04:51:43,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-10 04:51:43,244 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:43,339 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 04:51:44,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:44,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 910 states and 1149 transitions. [2018-11-10 04:51:44,355 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1149 transitions. [2018-11-10 04:51:44,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-10 04:51:44,356 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:44,461 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 04:51:44,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:44,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 914 states and 1153 transitions. [2018-11-10 04:51:44,642 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1153 transitions. [2018-11-10 04:51:44,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-10 04:51:44,642 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:44,734 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 04:51:44,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:44,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 923 states and 1163 transitions. [2018-11-10 04:51:44,923 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1163 transitions. [2018-11-10 04:51:44,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-10 04:51:44,924 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:45,010 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 04:51:45,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:45,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 930 states and 1169 transitions. [2018-11-10 04:51:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1169 transitions. [2018-11-10 04:51:45,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-10 04:51:45,291 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:45,314 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 04:51:45,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:45,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 947 states and 1188 transitions. [2018-11-10 04:51:45,866 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1188 transitions. [2018-11-10 04:51:45,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-10 04:51:45,867 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:45,892 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 04:51:46,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 951 states and 1193 transitions. [2018-11-10 04:51:46,094 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1193 transitions. [2018-11-10 04:51:46,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-10 04:51:46,094 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:46,206 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 04:51:46,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:46,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 997 states and 1245 transitions. [2018-11-10 04:51:46,890 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1245 transitions. [2018-11-10 04:51:46,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-10 04:51:46,891 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:46,917 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 04:51:47,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:47,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1010 states and 1257 transitions. [2018-11-10 04:51:47,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1257 transitions. [2018-11-10 04:51:47,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-10 04:51:47,194 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:47,219 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 04:51:47,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:47,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1015 states and 1264 transitions. [2018-11-10 04:51:47,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1264 transitions. [2018-11-10 04:51:47,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-10 04:51:47,256 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 04:51:47,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:47,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1022 states and 1271 transitions. [2018-11-10 04:51:47,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1271 transitions. [2018-11-10 04:51:47,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-10 04:51:47,326 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 04:51:47,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:47,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1029 states and 1279 transitions. [2018-11-10 04:51:47,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1279 transitions. [2018-11-10 04:51:47,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-10 04:51:47,466 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:47,490 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 04:51:47,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1035 states and 1286 transitions. [2018-11-10 04:51:47,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1286 transitions. [2018-11-10 04:51:47,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-10 04:51:47,711 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:47,731 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 04:51:47,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:47,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1044 states and 1297 transitions. [2018-11-10 04:51:47,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1297 transitions. [2018-11-10 04:51:47,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-10 04:51:47,771 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:47,806 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 04:51:48,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:48,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1064 states and 1325 transitions. [2018-11-10 04:51:48,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1325 transitions. [2018-11-10 04:51:48,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-10 04:51:48,742 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:48,776 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 04:51:49,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:49,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1079 states and 1342 transitions. [2018-11-10 04:51:49,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1342 transitions. [2018-11-10 04:51:49,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-10 04:51:49,703 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:49,737 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 04:51:49,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:49,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1083 states and 1349 transitions. [2018-11-10 04:51:49,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1349 transitions. [2018-11-10 04:51:49,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-10 04:51:49,987 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:50,032 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 04:51:50,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:50,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1088 states and 1355 transitions. [2018-11-10 04:51:50,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1355 transitions. [2018-11-10 04:51:50,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-10 04:51:50,343 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:50,402 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 04:51:50,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1097 states and 1365 transitions. [2018-11-10 04:51:50,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1365 transitions. [2018-11-10 04:51:50,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-10 04:51:50,985 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:51,626 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 167 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:53,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:53,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1121 states and 1399 transitions. [2018-11-10 04:51:53,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1399 transitions. [2018-11-10 04:51:53,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-10 04:51:53,320 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:53,384 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 167 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:53,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:53,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1127 states and 1406 transitions. [2018-11-10 04:51:53,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1406 transitions. [2018-11-10 04:51:53,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-10 04:51:53,890 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:53,978 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 167 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:54,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:54,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1136 states and 1414 transitions. [2018-11-10 04:51:54,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1414 transitions. [2018-11-10 04:51:54,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-10 04:51:54,535 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:54,561 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 04:51:54,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:54,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1147 states and 1425 transitions. [2018-11-10 04:51:54,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1425 transitions. [2018-11-10 04:51:54,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-10 04:51:54,598 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:54,628 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 04:51:54,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:54,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1148 states and 1426 transitions. [2018-11-10 04:51:54,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1426 transitions. [2018-11-10 04:51:54,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 04:51:54,645 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:54,686 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 04:51:54,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:54,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1160 states and 1439 transitions. [2018-11-10 04:51:54,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1439 transitions. [2018-11-10 04:51:54,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 04:51:54,775 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:54,817 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 04:51:55,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:55,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1161 states and 1442 transitions. [2018-11-10 04:51:55,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1442 transitions. [2018-11-10 04:51:55,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 04:51:55,083 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:55,125 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 04:51:55,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:55,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1165 states and 1447 transitions. [2018-11-10 04:51:55,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1447 transitions. [2018-11-10 04:51:55,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 04:51:55,379 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:55,828 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:57,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:57,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1178 states and 1469 transitions. [2018-11-10 04:51:57,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1469 transitions. [2018-11-10 04:51:57,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 04:51:57,967 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:58,052 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:58,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1183 states and 1475 transitions. [2018-11-10 04:51:58,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1475 transitions. [2018-11-10 04:51:58,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 04:51:58,677 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:58,747 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:51:59,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:51:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1192 states and 1485 transitions. [2018-11-10 04:51:59,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1485 transitions. [2018-11-10 04:51:59,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 04:51:59,272 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:51:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:51:59,431 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 160 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:52:01,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:01,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1267 states and 1574 transitions. [2018-11-10 04:52:01,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1574 transitions. [2018-11-10 04:52:01,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 04:52:01,786 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:01,884 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 160 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 04:52:02,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:02,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1280 states and 1589 transitions. [2018-11-10 04:52:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1589 transitions. [2018-11-10 04:52:02,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 04:52:02,927 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:02,978 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 04:52:04,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:04,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1312 states and 1632 transitions. [2018-11-10 04:52:04,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1632 transitions. [2018-11-10 04:52:04,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 04:52:04,552 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:04,611 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 04:52:05,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:05,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1322 states and 1645 transitions. [2018-11-10 04:52:05,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1645 transitions. [2018-11-10 04:52:05,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 04:52:05,451 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:05,494 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 04:52:05,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:05,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1326 states and 1650 transitions. [2018-11-10 04:52:05,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1650 transitions. [2018-11-10 04:52:05,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 04:52:05,873 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:05,935 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 04:52:06,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:06,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1327 states and 1651 transitions. [2018-11-10 04:52:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1651 transitions. [2018-11-10 04:52:06,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 04:52:06,316 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:06,359 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 04:52:06,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:06,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1331 states and 1655 transitions. [2018-11-10 04:52:06,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1655 transitions. [2018-11-10 04:52:06,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 04:52:06,768 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:06,814 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 04:52:08,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:08,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1348 states and 1682 transitions. [2018-11-10 04:52:08,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1682 transitions. [2018-11-10 04:52:08,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 04:52:08,153 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:08,199 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 04:52:09,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:09,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1355 states and 1695 transitions. [2018-11-10 04:52:09,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1695 transitions. [2018-11-10 04:52:09,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 04:52:09,164 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:09,211 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 04:52:09,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:09,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1369 states and 1709 transitions. [2018-11-10 04:52:09,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1709 transitions. [2018-11-10 04:52:09,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 04:52:09,663 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:09,709 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 04:52:10,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:10,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1373 states and 1717 transitions. [2018-11-10 04:52:10,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1717 transitions. [2018-11-10 04:52:10,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 04:52:10,133 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:10,180 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 04:52:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1390 states and 1735 transitions. [2018-11-10 04:52:11,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1735 transitions. [2018-11-10 04:52:11,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 04:52:11,578 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 04:52:12,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:12,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1395 states and 1741 transitions. [2018-11-10 04:52:12,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1741 transitions. [2018-11-10 04:52:12,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 04:52:12,007 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:12,669 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-10 04:52:14,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:14,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1426 states and 1778 transitions. [2018-11-10 04:52:14,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1778 transitions. [2018-11-10 04:52:14,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-10 04:52:14,096 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:14,133 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 04:52:15,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:15,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1456 states and 1810 transitions. [2018-11-10 04:52:15,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1810 transitions. [2018-11-10 04:52:15,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-10 04:52:15,055 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 04:52:15,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:15,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1461 states and 1815 transitions. [2018-11-10 04:52:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 1815 transitions. [2018-11-10 04:52:15,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-10 04:52:15,599 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:17,023 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 04:52:19,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:19,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1466 states and 1824 transitions. [2018-11-10 04:52:19,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 1824 transitions. [2018-11-10 04:52:19,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-10 04:52:19,255 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:19,293 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-10 04:52:19,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:19,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1477 states and 1836 transitions. [2018-11-10 04:52:19,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 1836 transitions. [2018-11-10 04:52:19,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-10 04:52:19,994 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:20,038 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-10 04:52:20,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:20,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1480 states and 1839 transitions. [2018-11-10 04:52:20,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1839 transitions. [2018-11-10 04:52:20,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-10 04:52:20,539 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 04:52:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1485 states and 1846 transitions. [2018-11-10 04:52:20,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 1846 transitions. [2018-11-10 04:52:20,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-10 04:52:20,938 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:21,776 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 04:52:23,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:23,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1508 states and 1875 transitions. [2018-11-10 04:52:23,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 1875 transitions. [2018-11-10 04:52:23,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-10 04:52:23,502 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:24,160 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 258 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-10 04:52:26,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:26,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1899 states to 1529 states and 1899 transitions. [2018-11-10 04:52:26,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 1899 transitions. [2018-11-10 04:52:26,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-10 04:52:26,206 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-10 04:52:28,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:28,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1554 states and 1931 transitions. [2018-11-10 04:52:28,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1931 transitions. [2018-11-10 04:52:28,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-10 04:52:28,763 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:28,818 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-10 04:52:29,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:29,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1559 states and 1936 transitions. [2018-11-10 04:52:29,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 1936 transitions. [2018-11-10 04:52:29,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-10 04:52:29,538 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:29,570 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-10 04:52:29,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:29,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1563 states and 1941 transitions. [2018-11-10 04:52:29,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1941 transitions. [2018-11-10 04:52:29,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-10 04:52:29,882 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:29,926 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-10 04:52:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1565 states and 1942 transitions. [2018-11-10 04:52:29,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1942 transitions. [2018-11-10 04:52:29,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-10 04:52:29,952 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-10 04:52:30,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:30,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1569 states and 1946 transitions. [2018-11-10 04:52:30,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 1946 transitions. [2018-11-10 04:52:30,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-10 04:52:30,646 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-10 04:52:30,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:30,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1570 states and 1946 transitions. [2018-11-10 04:52:30,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 1946 transitions. [2018-11-10 04:52:30,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-10 04:52:30,930 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:30,976 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-10 04:52:31,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:31,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1574 states and 1950 transitions. [2018-11-10 04:52:31,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 1950 transitions. [2018-11-10 04:52:31,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-10 04:52:31,371 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:31,404 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-10 04:52:31,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:31,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1575 states and 1950 transitions. [2018-11-10 04:52:31,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 1950 transitions. [2018-11-10 04:52:31,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-10 04:52:31,789 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:32,971 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-10 04:52:35,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:35,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1606 states and 1986 transitions. [2018-11-10 04:52:35,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1986 transitions. [2018-11-10 04:52:35,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-10 04:52:35,695 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:52:35,853 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-10 04:52:37,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 04:52:37,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 1623 states and 2003 transitions. [2018-11-10 04:52:37,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2003 transitions. [2018-11-10 04:52:37,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-10 04:52:37,526 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 04:52:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:52:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:52:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:52:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:52:37,758 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 116 iterations. [2018-11-10 04:52:37,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 04:52:37 ImpRootNode [2018-11-10 04:52:37,889 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 04:52:37,889 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:52:37,889 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:52:37,890 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:52:37,891 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:51:22" (3/4) ... [2018-11-10 04:52:37,893 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 04:52:37,986 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6d873cc0-424b-4b62-b3d9-c7b59684683b/bin-2019/ukojak/witness.graphml [2018-11-10 04:52:37,986 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:52:37,987 INFO L168 Benchmark]: Toolchain (without parser) took 77246.79 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 952.3 MB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 522.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:52:37,988 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:52:37,988 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.38 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 922.7 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-10 04:52:37,988 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 922.7 MB in the beginning and 1.2 GB in the end (delta: -227.9 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2018-11-10 04:52:37,988 INFO L168 Benchmark]: Boogie Preprocessor took 40.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-10 04:52:37,988 INFO L168 Benchmark]: RCFGBuilder took 1307.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 912.8 MB in the end (delta: 234.5 MB). Peak memory consumption was 234.5 MB. Max. memory is 11.5 GB. [2018-11-10 04:52:37,989 INFO L168 Benchmark]: CodeCheck took 75339.63 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 912.8 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 321.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:52:37,989 INFO L168 Benchmark]: Witness Printer took 96.97 ms. Allocated memory is still 2.9 GB. Free memory is still 2.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:52:37,990 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, 75.1s OverallTime, 116 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -341948928 SDtfs, 1884694184 SDslu, -411219712 SDs, 0 SdLazy, -1294991684 SolverSat, -456530908 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 275.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115522 GetRequests, 111176 SyntacticMatches, 3394 SemanticMatches, 952 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589042 ImplicationChecksByTransitivity, 63.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 17421 NumberOfCodeBlocks, 17421 NumberOfCodeBlocksAsserted, 116 NumberOfCheckSat, 17085 ConstructedInterpolants, 0 QuantifiedInterpolants, 11761102 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 115 InterpolantComputations, 89 PerfectInterpolantSequences, 13635/13948 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 356.38 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 922.7 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 102.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 922.7 MB in the beginning and 1.2 GB in the end (delta: -227.9 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1307.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 912.8 MB in the end (delta: 234.5 MB). Peak memory consumption was 234.5 MB. Max. memory is 11.5 GB. * CodeCheck took 75339.63 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 912.8 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 321.8 MB. Max. memory is 11.5 GB. * Witness Printer took 96.97 ms. Allocated memory is still 2.9 GB. Free memory is still 2.3 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...