./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label32_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_8858165f-dd0c-4968-a9eb-6dd36e8d8290/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8858165f-dd0c-4968-a9eb-6dd36e8d8290/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8858165f-dd0c-4968-a9eb-6dd36e8d8290/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8858165f-dd0c-4968-a9eb-6dd36e8d8290/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label32_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8858165f-dd0c-4968-a9eb-6dd36e8d8290/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8858165f-dd0c-4968-a9eb-6dd36e8d8290/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 01168fbb381348520b892fee62d1bbd6a25fcfcb ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 07:28:17,300 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:28:17,301 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:28:17,308 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:28:17,308 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:28:17,309 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:28:17,310 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:28:17,311 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:28:17,312 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:28:17,312 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:28:17,313 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:28:17,313 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:28:17,314 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:28:17,315 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:28:17,315 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:28:17,316 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:28:17,316 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:28:17,318 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:28:17,319 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:28:17,320 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:28:17,321 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:28:17,322 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:28:17,323 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:28:17,323 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:28:17,323 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:28:17,324 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:28:17,325 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:28:17,325 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:28:17,326 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:28:17,326 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:28:17,327 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:28:17,327 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:28:17,327 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:28:17,327 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:28:17,328 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:28:17,329 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:28:17,329 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8858165f-dd0c-4968-a9eb-6dd36e8d8290/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 07:28:17,339 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:28:17,339 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:28:17,339 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:28:17,339 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 07:28:17,340 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:28:17,340 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:28:17,340 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:28:17,340 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:28:17,340 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:28:17,341 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:28:17,341 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:28:17,341 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:28:17,341 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:28:17,341 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:28:17,341 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:28:17,341 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:28:17,341 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:28:17,342 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 07:28:17,342 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 07:28:17,342 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:28:17,342 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:28:17,342 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 07:28:17,342 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:28:17,342 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:28:17,343 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:28:17,343 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 07:28:17,343 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:28:17,343 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:28:17,343 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_8858165f-dd0c-4968-a9eb-6dd36e8d8290/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 -> 01168fbb381348520b892fee62d1bbd6a25fcfcb [2018-11-10 07:28:17,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:28:17,374 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:28:17,376 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:28:17,377 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:28:17,377 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:28:17,378 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8858165f-dd0c-4968-a9eb-6dd36e8d8290/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label32_false-unreach-call_false-termination.c [2018-11-10 07:28:17,414 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8858165f-dd0c-4968-a9eb-6dd36e8d8290/bin-2019/ukojak/data/63bf513a1/bcbc6a3bcacc4e2b8bea4df308832de8/FLAG0564257d9 [2018-11-10 07:28:17,865 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:28:17,866 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8858165f-dd0c-4968-a9eb-6dd36e8d8290/sv-benchmarks/c/eca-rers2012/Problem01_label32_false-unreach-call_false-termination.c [2018-11-10 07:28:17,875 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8858165f-dd0c-4968-a9eb-6dd36e8d8290/bin-2019/ukojak/data/63bf513a1/bcbc6a3bcacc4e2b8bea4df308832de8/FLAG0564257d9 [2018-11-10 07:28:17,887 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8858165f-dd0c-4968-a9eb-6dd36e8d8290/bin-2019/ukojak/data/63bf513a1/bcbc6a3bcacc4e2b8bea4df308832de8 [2018-11-10 07:28:17,889 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:28:17,891 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:28:17,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:28:17,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:28:17,894 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:28:17,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:28:17" (1/1) ... [2018-11-10 07:28:17,897 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 07:28:17, skipping insertion in model container [2018-11-10 07:28:17,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:28:17" (1/1) ... [2018-11-10 07:28:17,905 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:28:17,943 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:28:18,159 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:28:18,162 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:28:18,228 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:28:18,240 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:28:18,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:28:18 WrapperNode [2018-11-10 07:28:18,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:28:18,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:28:18,242 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:28:18,242 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:28:18,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:28:18" (1/1) ... [2018-11-10 07:28:18,265 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:28:18" (1/1) ... [2018-11-10 07:28:18,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:28:18,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:28:18,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:28:18,350 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:28:18,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:28:18" (1/1) ... [2018-11-10 07:28:18,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:28:18" (1/1) ... [2018-11-10 07:28:18,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:28:18" (1/1) ... [2018-11-10 07:28:18,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:28:18" (1/1) ... [2018-11-10 07:28:18,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:28:18" (1/1) ... [2018-11-10 07:28:18,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:28:18" (1/1) ... [2018-11-10 07:28:18,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:28:18" (1/1) ... [2018-11-10 07:28:18,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:28:18,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:28:18,392 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:28:18,392 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:28:18,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:28:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8858165f-dd0c-4968-a9eb-6dd36e8d8290/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 07:28:18,443 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 07:28:18,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:28:18,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:28:19,686 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:28:19,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:28:19 BoogieIcfgContainer [2018-11-10 07:28:19,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:28:19,687 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 07:28:19,687 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 07:28:19,694 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 07:28:19,695 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:28:19" (1/1) ... [2018-11-10 07:28:19,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:28:19,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 77 states and 146 transitions. [2018-11-10 07:28:19,727 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 146 transitions. [2018-11-10 07:28:19,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 07:28:19,731 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:19,942 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 07:28:20,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 147 states and 233 transitions. [2018-11-10 07:28:20,388 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 233 transitions. [2018-11-10 07:28:20,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 07:28:20,390 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:20,470 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 07:28:20,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:20,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 218 states and 307 transitions. [2018-11-10 07:28:20,832 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 307 transitions. [2018-11-10 07:28:20,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 07:28:20,834 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:20,933 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 07:28:21,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:21,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 289 states and 382 transitions. [2018-11-10 07:28:21,292 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 382 transitions. [2018-11-10 07:28:21,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 07:28:21,294 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:21,339 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:28:21,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:21,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 305 states and 402 transitions. [2018-11-10 07:28:21,440 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 402 transitions. [2018-11-10 07:28:21,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 07:28:21,443 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:21,472 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 07:28:21,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:21,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 306 states and 404 transitions. [2018-11-10 07:28:21,597 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 404 transitions. [2018-11-10 07:28:21,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 07:28:21,601 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:28:21,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:21,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 327 states and 430 transitions. [2018-11-10 07:28:21,891 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 430 transitions. [2018-11-10 07:28:21,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 07:28:21,892 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:21,921 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 07:28:22,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:22,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 328 states and 432 transitions. [2018-11-10 07:28:22,015 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 432 transitions. [2018-11-10 07:28:22,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-10 07:28:22,016 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:22,055 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 07:28:22,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:22,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 329 states and 434 transitions. [2018-11-10 07:28:22,206 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 434 transitions. [2018-11-10 07:28:22,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 07:28:22,207 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:22,237 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 07:28:22,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:22,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 334 states and 440 transitions. [2018-11-10 07:28:22,363 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 440 transitions. [2018-11-10 07:28:22,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 07:28:22,364 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:22,404 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 07:28:22,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 348 states and 454 transitions. [2018-11-10 07:28:22,616 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 454 transitions. [2018-11-10 07:28:22,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 07:28:22,617 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:22,692 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 07:28:23,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:23,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 364 states and 477 transitions. [2018-11-10 07:28:23,039 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 477 transitions. [2018-11-10 07:28:23,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 07:28:23,040 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:23,097 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 07:28:23,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:23,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 394 states and 508 transitions. [2018-11-10 07:28:23,371 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 508 transitions. [2018-11-10 07:28:23,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 07:28:23,372 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:23,390 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 07:28:23,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:23,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 408 states and 524 transitions. [2018-11-10 07:28:23,532 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 524 transitions. [2018-11-10 07:28:23,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-10 07:28:23,533 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:23,609 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 07:28:24,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:24,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 449 states and 573 transitions. [2018-11-10 07:28:24,230 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 573 transitions. [2018-11-10 07:28:24,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 07:28:24,232 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:24,311 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 07:28:24,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:24,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 459 states and 588 transitions. [2018-11-10 07:28:24,578 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 588 transitions. [2018-11-10 07:28:24,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 07:28:24,579 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:24,603 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 07:28:24,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:24,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 464 states and 593 transitions. [2018-11-10 07:28:24,636 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 593 transitions. [2018-11-10 07:28:24,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 07:28:24,637 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 07:28:25,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:25,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 479 states and 613 transitions. [2018-11-10 07:28:25,198 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 613 transitions. [2018-11-10 07:28:25,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 07:28:25,199 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:25,234 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:28:25,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:25,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 483 states and 617 transitions. [2018-11-10 07:28:25,379 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 617 transitions. [2018-11-10 07:28:25,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 07:28:25,380 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:25,538 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 07:28:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:25,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 489 states and 624 transitions. [2018-11-10 07:28:25,775 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 624 transitions. [2018-11-10 07:28:25,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 07:28:25,775 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:25,795 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 07:28:26,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:26,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 504 states and 642 transitions. [2018-11-10 07:28:26,249 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 642 transitions. [2018-11-10 07:28:26,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 07:28:26,250 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:26,273 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 07:28:26,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:26,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 508 states and 648 transitions. [2018-11-10 07:28:26,458 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 648 transitions. [2018-11-10 07:28:26,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 07:28:26,460 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:26,516 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 07:28:26,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:26,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 519 states and 659 transitions. [2018-11-10 07:28:26,620 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 659 transitions. [2018-11-10 07:28:26,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 07:28:26,621 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:26,645 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 07:28:26,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:26,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 541 states and 681 transitions. [2018-11-10 07:28:26,714 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 681 transitions. [2018-11-10 07:28:26,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 07:28:26,715 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:26,771 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 07:28:27,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:27,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 555 states and 698 transitions. [2018-11-10 07:28:27,225 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 698 transitions. [2018-11-10 07:28:27,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-10 07:28:27,226 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:27,262 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 07:28:27,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:27,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 558 states and 702 transitions. [2018-11-10 07:28:27,471 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 702 transitions. [2018-11-10 07:28:27,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 07:28:27,472 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:27,523 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 07:28:27,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:27,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 583 states and 731 transitions. [2018-11-10 07:28:27,934 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 731 transitions. [2018-11-10 07:28:27,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-10 07:28:27,934 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:28,275 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 07:28:28,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:28,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 597 states and 746 transitions. [2018-11-10 07:28:28,642 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 746 transitions. [2018-11-10 07:28:28,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-10 07:28:28,643 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:28,671 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 07:28:28,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:28,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 604 states and 754 transitions. [2018-11-10 07:28:28,756 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 754 transitions. [2018-11-10 07:28:28,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 07:28:28,756 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:28,877 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 07:28:29,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:29,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 605 states and 758 transitions. [2018-11-10 07:28:29,116 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 758 transitions. [2018-11-10 07:28:29,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 07:28:29,117 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 07:28:29,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:29,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 617 states and 773 transitions. [2018-11-10 07:28:29,312 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 773 transitions. [2018-11-10 07:28:29,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 07:28:29,313 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:29,337 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 07:28:29,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:29,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 618 states and 773 transitions. [2018-11-10 07:28:29,427 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 773 transitions. [2018-11-10 07:28:29,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-10 07:28:29,427 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:29,767 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:28:31,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:31,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 683 states and 842 transitions. [2018-11-10 07:28:31,003 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 842 transitions. [2018-11-10 07:28:31,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-10 07:28:31,004 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:31,146 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 07:28:31,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:31,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 729 states and 903 transitions. [2018-11-10 07:28:31,956 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 903 transitions. [2018-11-10 07:28:31,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-10 07:28:31,957 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:32,075 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 07:28:32,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:32,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 750 states and 930 transitions. [2018-11-10 07:28:32,756 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 930 transitions. [2018-11-10 07:28:32,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-10 07:28:32,757 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:32,885 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 07:28:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:33,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 761 states and 942 transitions. [2018-11-10 07:28:33,197 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 942 transitions. [2018-11-10 07:28:33,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-10 07:28:33,198 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:33,304 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 07:28:33,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:33,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 762 states and 942 transitions. [2018-11-10 07:28:33,441 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 942 transitions. [2018-11-10 07:28:33,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-10 07:28:33,442 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:33,530 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 07:28:33,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:33,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 763 states and 942 transitions. [2018-11-10 07:28:33,680 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 942 transitions. [2018-11-10 07:28:33,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 07:28:33,681 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:33,752 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 07:28:33,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:33,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 765 states and 951 transitions. [2018-11-10 07:28:33,868 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 951 transitions. [2018-11-10 07:28:33,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-10 07:28:33,869 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:33,891 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 07:28:33,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:33,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 772 states and 958 transitions. [2018-11-10 07:28:33,920 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 958 transitions. [2018-11-10 07:28:33,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-10 07:28:33,920 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:33,945 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 07:28:34,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:34,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 790 states and 981 transitions. [2018-11-10 07:28:34,353 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 981 transitions. [2018-11-10 07:28:34,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-10 07:28:34,354 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:34,374 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 07:28:34,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:34,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 794 states and 984 transitions. [2018-11-10 07:28:34,466 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 984 transitions. [2018-11-10 07:28:34,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-10 07:28:34,467 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:34,499 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 07:28:34,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:34,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 796 states and 985 transitions. [2018-11-10 07:28:34,591 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 985 transitions. [2018-11-10 07:28:34,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 07:28:34,592 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:35,040 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:28:35,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:35,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 797 states and 994 transitions. [2018-11-10 07:28:35,468 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 994 transitions. [2018-11-10 07:28:35,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 07:28:35,469 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:35,572 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:28:36,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:36,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 866 states and 1066 transitions. [2018-11-10 07:28:36,648 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1066 transitions. [2018-11-10 07:28:36,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-10 07:28:36,648 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 07:28:36,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:36,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 867 states and 1066 transitions. [2018-11-10 07:28:36,717 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1066 transitions. [2018-11-10 07:28:36,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 07:28:36,718 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:36,895 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:28:37,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:37,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 894 states and 1093 transitions. [2018-11-10 07:28:37,690 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1093 transitions. [2018-11-10 07:28:37,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 07:28:37,690 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:37,723 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:28:38,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 915 states and 1113 transitions. [2018-11-10 07:28:38,245 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1113 transitions. [2018-11-10 07:28:38,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 07:28:38,246 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:38,279 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:28:38,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:38,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 918 states and 1116 transitions. [2018-11-10 07:28:38,627 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1116 transitions. [2018-11-10 07:28:38,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 07:28:38,628 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:38,698 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-10 07:28:38,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:38,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 924 states and 1122 transitions. [2018-11-10 07:28:38,799 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1122 transitions. [2018-11-10 07:28:38,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-10 07:28:38,800 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:39,022 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 115 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 07:28:39,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:39,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 936 states and 1141 transitions. [2018-11-10 07:28:39,754 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1141 transitions. [2018-11-10 07:28:39,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-10 07:28:39,755 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:39,786 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 07:28:39,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:39,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 939 states and 1144 transitions. [2018-11-10 07:28:39,879 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1144 transitions. [2018-11-10 07:28:39,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-10 07:28:39,880 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:39,940 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 07:28:40,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:40,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 941 states and 1146 transitions. [2018-11-10 07:28:40,090 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1146 transitions. [2018-11-10 07:28:40,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-10 07:28:40,091 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:40,127 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 07:28:40,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:40,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 942 states and 1150 transitions. [2018-11-10 07:28:40,313 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1150 transitions. [2018-11-10 07:28:40,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-10 07:28:40,314 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:40,350 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 07:28:40,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:40,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 965 states and 1173 transitions. [2018-11-10 07:28:40,413 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1173 transitions. [2018-11-10 07:28:40,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-10 07:28:40,414 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:40,512 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-10 07:28:41,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:41,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 976 states and 1188 transitions. [2018-11-10 07:28:41,091 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1188 transitions. [2018-11-10 07:28:41,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-10 07:28:41,091 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:41,211 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 07:28:41,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:41,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 997 states and 1215 transitions. [2018-11-10 07:28:41,754 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1215 transitions. [2018-11-10 07:28:41,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-10 07:28:41,755 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:41,811 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 07:28:42,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:42,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1022 states and 1245 transitions. [2018-11-10 07:28:42,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1245 transitions. [2018-11-10 07:28:42,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-10 07:28:42,421 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:42,599 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 110 proven. 11 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 07:28:43,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:43,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1041 states and 1267 transitions. [2018-11-10 07:28:43,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1267 transitions. [2018-11-10 07:28:43,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 07:28:43,165 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:43,701 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 165 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 07:28:44,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:44,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1055 states and 1283 transitions. [2018-11-10 07:28:44,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1283 transitions. [2018-11-10 07:28:44,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 07:28:44,476 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:44,548 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 07:28:44,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:44,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1057 states and 1286 transitions. [2018-11-10 07:28:44,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1286 transitions. [2018-11-10 07:28:44,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 07:28:44,670 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:44,732 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 07:28:44,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:44,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1058 states and 1290 transitions. [2018-11-10 07:28:44,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1290 transitions. [2018-11-10 07:28:44,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-10 07:28:44,996 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:45,039 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-10 07:28:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:45,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1060 states and 1290 transitions. [2018-11-10 07:28:45,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1290 transitions. [2018-11-10 07:28:45,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-10 07:28:45,433 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:45,473 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-10 07:28:45,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:45,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1061 states and 1290 transitions. [2018-11-10 07:28:45,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1290 transitions. [2018-11-10 07:28:45,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 07:28:45,746 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:45,855 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 127 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-10 07:28:47,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:47,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1138 states and 1379 transitions. [2018-11-10 07:28:47,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1379 transitions. [2018-11-10 07:28:47,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-10 07:28:47,278 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:47,319 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 07:28:47,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:47,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1142 states and 1386 transitions. [2018-11-10 07:28:47,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1386 transitions. [2018-11-10 07:28:47,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-10 07:28:47,651 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:47,685 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 07:28:48,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:48,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1189 states and 1435 transitions. [2018-11-10 07:28:48,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1435 transitions. [2018-11-10 07:28:48,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-10 07:28:48,037 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:48,072 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 07:28:48,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:48,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1190 states and 1435 transitions. [2018-11-10 07:28:48,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1435 transitions. [2018-11-10 07:28:48,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-10 07:28:48,279 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:48,372 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 07:28:48,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:48,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1211 states and 1462 transitions. [2018-11-10 07:28:48,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1462 transitions. [2018-11-10 07:28:48,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-10 07:28:48,934 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:49,043 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 07:28:49,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:49,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1236 states and 1487 transitions. [2018-11-10 07:28:49,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1487 transitions. [2018-11-10 07:28:49,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-10 07:28:49,946 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 07:28:52,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:52,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1278 states and 1539 transitions. [2018-11-10 07:28:52,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1539 transitions. [2018-11-10 07:28:52,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-10 07:28:52,733 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 07:28:53,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:53,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1281 states and 1542 transitions. [2018-11-10 07:28:53,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1542 transitions. [2018-11-10 07:28:53,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-10 07:28:53,285 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 07:28:55,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:55,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1290 states and 1555 transitions. [2018-11-10 07:28:55,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1555 transitions. [2018-11-10 07:28:55,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-10 07:28:55,937 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:56,063 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 07:28:57,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:57,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1307 states and 1574 transitions. [2018-11-10 07:28:57,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1574 transitions. [2018-11-10 07:28:57,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-10 07:28:57,366 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 07:28:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1334 states and 1600 transitions. [2018-11-10 07:28:58,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1600 transitions. [2018-11-10 07:28:58,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-10 07:28:58,148 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:58,641 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 167 proven. 74 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 07:28:59,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:59,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1342 states and 1615 transitions. [2018-11-10 07:28:59,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1615 transitions. [2018-11-10 07:28:59,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-10 07:28:59,568 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:59,612 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-11-10 07:28:59,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:28:59,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1363 states and 1635 transitions. [2018-11-10 07:28:59,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1635 transitions. [2018-11-10 07:28:59,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-10 07:28:59,853 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:28:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:28:59,891 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2018-11-10 07:29:00,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:00,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1366 states and 1638 transitions. [2018-11-10 07:29:00,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1638 transitions. [2018-11-10 07:29:00,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-11-10 07:29:00,113 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:00,475 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 242 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 07:29:02,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:02,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1421 states and 1704 transitions. [2018-11-10 07:29:02,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1704 transitions. [2018-11-10 07:29:02,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-10 07:29:02,117 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:02,277 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 167 proven. 5 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-10 07:29:02,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:02,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1422 states and 1704 transitions. [2018-11-10 07:29:02,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1704 transitions. [2018-11-10 07:29:02,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-10 07:29:02,465 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 07:29:06,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:06,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1487 states and 1771 transitions. [2018-11-10 07:29:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 1771 transitions. [2018-11-10 07:29:06,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-10 07:29:06,643 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:06,747 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 179 proven. 5 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-10 07:29:07,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:07,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1518 states and 1808 transitions. [2018-11-10 07:29:07,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1808 transitions. [2018-11-10 07:29:07,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-10 07:29:07,175 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:07,274 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 179 proven. 5 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-10 07:29:07,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:07,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1523 states and 1817 transitions. [2018-11-10 07:29:07,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1817 transitions. [2018-11-10 07:29:07,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-10 07:29:07,509 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:07,828 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 4 proven. 192 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-10 07:29:09,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:09,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1616 states and 1924 transitions. [2018-11-10 07:29:09,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 1924 transitions. [2018-11-10 07:29:09,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-10 07:29:09,353 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:09,989 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-10 07:29:12,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:12,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1638 states and 1957 transitions. [2018-11-10 07:29:12,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 1957 transitions. [2018-11-10 07:29:12,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-11-10 07:29:12,314 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:12,390 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 152 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-10 07:29:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:14,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 1678 states and 2011 transitions. [2018-11-10 07:29:14,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2011 transitions. [2018-11-10 07:29:14,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-11-10 07:29:14,366 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:14,425 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 152 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-10 07:29:15,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:15,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 1693 states and 2028 transitions. [2018-11-10 07:29:15,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2028 transitions. [2018-11-10 07:29:15,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-11-10 07:29:15,725 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:15,789 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 152 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-10 07:29:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 1698 states and 2033 transitions. [2018-11-10 07:29:16,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2033 transitions. [2018-11-10 07:29:16,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-11-10 07:29:16,077 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 152 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-10 07:29:16,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:16,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 1700 states and 2034 transitions. [2018-11-10 07:29:16,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2034 transitions. [2018-11-10 07:29:16,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-10 07:29:16,366 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:16,444 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 153 proven. 2 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-10 07:29:19,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:19,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 1771 states and 2114 transitions. [2018-11-10 07:29:19,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2114 transitions. [2018-11-10 07:29:19,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-11-10 07:29:19,631 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:19,700 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 160 proven. 3 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-11-10 07:29:21,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:21,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 1801 states and 2149 transitions. [2018-11-10 07:29:21,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2149 transitions. [2018-11-10 07:29:21,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-11-10 07:29:21,011 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:21,073 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 160 proven. 3 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-11-10 07:29:21,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:21,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 1815 states and 2166 transitions. [2018-11-10 07:29:21,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2166 transitions. [2018-11-10 07:29:21,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-11-10 07:29:21,919 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:22,040 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 160 proven. 3 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-11-10 07:29:23,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:23,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 1845 states and 2196 transitions. [2018-11-10 07:29:23,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2196 transitions. [2018-11-10 07:29:23,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-11-10 07:29:23,344 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:23,407 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 160 proven. 3 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-11-10 07:29:24,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:24,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 1856 states and 2207 transitions. [2018-11-10 07:29:24,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2207 transitions. [2018-11-10 07:29:24,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-11-10 07:29:24,010 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:24,901 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 309 proven. 41 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-10 07:29:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:27,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 1887 states and 2245 transitions. [2018-11-10 07:29:27,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2245 transitions. [2018-11-10 07:29:27,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-11-10 07:29:27,739 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:27,819 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 309 proven. 41 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-10 07:29:29,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:29,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 1901 states and 2261 transitions. [2018-11-10 07:29:29,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2261 transitions. [2018-11-10 07:29:29,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-11-10 07:29:29,378 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:29,425 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-10 07:29:29,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:29,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 1902 states and 2261 transitions. [2018-11-10 07:29:29,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2261 transitions. [2018-11-10 07:29:29,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-11-10 07:29:29,674 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:29,731 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-10 07:29:30,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:30,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 1909 states and 2268 transitions. [2018-11-10 07:29:30,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1909 states and 2268 transitions. [2018-11-10 07:29:30,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-11-10 07:29:30,088 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:30,700 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 226 proven. 50 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-10 07:29:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:34,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 1978 states and 2347 transitions. [2018-11-10 07:29:34,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2347 transitions. [2018-11-10 07:29:34,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-11-10 07:29:34,508 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:34,574 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 166 proven. 3 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2018-11-10 07:29:34,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:34,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 1987 states and 2357 transitions. [2018-11-10 07:29:34,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2357 transitions. [2018-11-10 07:29:34,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-11-10 07:29:34,972 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:35,039 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 166 proven. 3 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2018-11-10 07:29:35,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:35,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2376 states to 2007 states and 2376 transitions. [2018-11-10 07:29:35,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 2376 transitions. [2018-11-10 07:29:35,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-11-10 07:29:35,690 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:35,747 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-10 07:29:36,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:36,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2397 states to 2028 states and 2397 transitions. [2018-11-10 07:29:36,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 2397 transitions. [2018-11-10 07:29:36,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-11-10 07:29:36,758 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:36,816 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-10 07:29:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 2046 states and 2417 transitions. [2018-11-10 07:29:38,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 2417 transitions. [2018-11-10 07:29:38,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-11-10 07:29:38,751 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:38,818 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-10 07:29:39,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:39,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2063 states and 2434 transitions. [2018-11-10 07:29:39,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2063 states and 2434 transitions. [2018-11-10 07:29:39,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-10 07:29:39,792 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:39,894 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 168 proven. 2 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-10 07:29:40,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:40,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2065 states and 2435 transitions. [2018-11-10 07:29:40,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 2435 transitions. [2018-11-10 07:29:40,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-11-10 07:29:40,114 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:40,176 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-10 07:29:40,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:40,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2070 states and 2442 transitions. [2018-11-10 07:29:40,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 2442 transitions. [2018-11-10 07:29:40,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-11-10 07:29:40,624 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:41,697 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 286 proven. 56 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-10 07:29:45,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:45,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2115 states and 2490 transitions. [2018-11-10 07:29:45,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2490 transitions. [2018-11-10 07:29:45,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-11-10 07:29:45,325 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:45,786 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 286 proven. 56 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-10 07:29:47,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:47,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2129 states and 2505 transitions. [2018-11-10 07:29:47,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 2505 transitions. [2018-11-10 07:29:47,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-10 07:29:47,289 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:47,348 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-10 07:29:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2189 states and 2569 transitions. [2018-11-10 07:29:51,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 2569 transitions. [2018-11-10 07:29:51,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-10 07:29:51,670 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:29:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-10 07:29:53,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 07:29:53,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2584 states to 2203 states and 2584 transitions. [2018-11-10 07:29:53,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2203 states and 2584 transitions. [2018-11-10 07:29:53,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-10 07:29:53,170 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 07:29:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:29:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:29:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:29:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:29:53,405 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 110 iterations. [2018-11-10 07:29:53,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 07:29:53 ImpRootNode [2018-11-10 07:29:53,545 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 07:29:53,545 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:29:53,545 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:29:53,545 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:29:53,546 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:28:19" (3/4) ... [2018-11-10 07:29:53,549 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 07:29:53,651 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8858165f-dd0c-4968-a9eb-6dd36e8d8290/bin-2019/ukojak/witness.graphml [2018-11-10 07:29:53,651 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:29:53,652 INFO L168 Benchmark]: Toolchain (without parser) took 95761.87 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 957.5 MB in the beginning and 1.4 GB in the end (delta: -419.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-11-10 07:29:53,652 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:29:53,653 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.04 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 922.6 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:29:53,653 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 922.6 MB in the beginning and 1.2 GB in the end (delta: -249.5 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:29:53,653 INFO L168 Benchmark]: Boogie Preprocessor took 41.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:29:53,653 INFO L168 Benchmark]: RCFGBuilder took 1294.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 925.5 MB in the end (delta: 240.2 MB). Peak memory consumption was 240.2 MB. Max. memory is 11.5 GB. [2018-11-10 07:29:53,654 INFO L168 Benchmark]: CodeCheck took 93857.51 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 925.5 MB in the beginning and 1.4 GB in the end (delta: -491.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-11-10 07:29:53,654 INFO L168 Benchmark]: Witness Printer took 106.20 ms. Allocated memory is still 3.1 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 40.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 11.5 GB. [2018-11-10 07:29:53,655 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, 93.6s OverallTime, 110 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 492974080 SDtfs, -723384700 SDslu, 224600064 SDs, 0 SdLazy, -1086895220 SolverSat, 1654989980 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 310.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 123877 GetRequests, 120871 SyntacticMatches, 1854 SemanticMatches, 1152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 952228 ImplicationChecksByTransitivity, 78.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 18994 NumberOfCodeBlocks, 18994 NumberOfCodeBlocksAsserted, 110 NumberOfCheckSat, 18635 ConstructedInterpolants, 0 QuantifiedInterpolants, 12859768 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 109 InterpolantComputations, 81 PerfectInterpolantSequences, 18653/19244 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: 398]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] RET return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] RET return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] RET return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] RET return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND TRUE ((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1))) [L149] a16 = 4 [L150] a17 = 0 [L151] RET return 25; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND TRUE (((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1)) [L130] a8 = 15 [L131] a17 = 0 [L132] a21 = 1 [L133] a20 = 0 [L134] a16 = 4 [L135] RET return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=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=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L397] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L398] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 350.04 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 922.6 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 108.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 922.6 MB in the beginning and 1.2 GB in the end (delta: -249.5 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1294.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 925.5 MB in the end (delta: 240.2 MB). Peak memory consumption was 240.2 MB. Max. memory is 11.5 GB. * CodeCheck took 93857.51 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 925.5 MB in the beginning and 1.4 GB in the end (delta: -491.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 106.20 ms. Allocated memory is still 3.1 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 40.2 MB). Peak memory consumption was 40.2 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...