./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label38_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_3c22dd50-5630-4ad9-aa17-79f6c45c5471/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3c22dd50-5630-4ad9-aa17-79f6c45c5471/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3c22dd50-5630-4ad9-aa17-79f6c45c5471/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3c22dd50-5630-4ad9-aa17-79f6c45c5471/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label38_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3c22dd50-5630-4ad9-aa17-79f6c45c5471/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3c22dd50-5630-4ad9-aa17-79f6c45c5471/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 5d9bfdaf23db32516d1ccf8929c6af5e4a9d3bd0 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 13:10:24,259 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:10:24,261 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:10:24,270 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:10:24,270 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:10:24,271 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:10:24,272 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:10:24,273 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:10:24,275 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:10:24,275 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:10:24,276 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:10:24,276 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:10:24,277 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:10:24,278 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:10:24,279 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:10:24,280 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:10:24,280 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:10:24,282 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:10:24,283 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:10:24,285 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:10:24,286 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:10:24,287 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:10:24,288 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:10:24,289 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:10:24,289 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:10:24,290 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:10:24,291 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:10:24,291 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:10:24,292 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:10:24,293 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:10:24,293 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:10:24,294 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:10:24,294 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:10:24,295 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:10:24,295 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:10:24,296 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:10:24,296 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3c22dd50-5630-4ad9-aa17-79f6c45c5471/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 13:10:24,307 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:10:24,307 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:10:24,308 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 13:10:24,308 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 13:10:24,308 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 13:10:24,309 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 13:10:24,309 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:10:24,309 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:10:24,309 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:10:24,309 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:10:24,309 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:10:24,309 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 13:10:24,310 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 13:10:24,310 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 13:10:24,310 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:10:24,310 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:10:24,310 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 13:10:24,310 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 13:10:24,310 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 13:10:24,311 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:10:24,311 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 13:10:24,311 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 13:10:24,311 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:10:24,311 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 13:10:24,311 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 13:10:24,312 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 13:10:24,312 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 13:10:24,312 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 13:10:24,312 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_3c22dd50-5630-4ad9-aa17-79f6c45c5471/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 -> 5d9bfdaf23db32516d1ccf8929c6af5e4a9d3bd0 [2018-11-10 13:10:24,338 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:10:24,347 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:10:24,350 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:10:24,351 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:10:24,351 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:10:24,352 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3c22dd50-5630-4ad9-aa17-79f6c45c5471/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label38_false-unreach-call_false-termination.c [2018-11-10 13:10:24,395 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3c22dd50-5630-4ad9-aa17-79f6c45c5471/bin-2019/ukojak/data/989859b94/c2321e5d1a034a0c837d2cb254216d9c/FLAG028a9734a [2018-11-10 13:10:24,842 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:10:24,843 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3c22dd50-5630-4ad9-aa17-79f6c45c5471/sv-benchmarks/c/eca-rers2012/Problem01_label38_false-unreach-call_false-termination.c [2018-11-10 13:10:24,851 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3c22dd50-5630-4ad9-aa17-79f6c45c5471/bin-2019/ukojak/data/989859b94/c2321e5d1a034a0c837d2cb254216d9c/FLAG028a9734a [2018-11-10 13:10:24,863 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3c22dd50-5630-4ad9-aa17-79f6c45c5471/bin-2019/ukojak/data/989859b94/c2321e5d1a034a0c837d2cb254216d9c [2018-11-10 13:10:24,866 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:10:24,866 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:10:24,867 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:10:24,867 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:10:24,870 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:10:24,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:10:24" (1/1) ... [2018-11-10 13:10:24,872 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 01:10:24, skipping insertion in model container [2018-11-10 13:10:24,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:10:24" (1/1) ... [2018-11-10 13:10:24,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:10:24,911 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:10:25,141 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:10:25,145 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:10:25,211 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:10:25,224 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:10:25,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:25 WrapperNode [2018-11-10 13:10:25,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:10:25,225 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:10:25,225 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:10:25,225 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:10:25,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:25" (1/1) ... [2018-11-10 13:10:25,246 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:25" (1/1) ... [2018-11-10 13:10:25,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:10:25,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:10:25,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:10:25,329 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:10:25,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:25" (1/1) ... [2018-11-10 13:10:25,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:25" (1/1) ... [2018-11-10 13:10:25,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:25" (1/1) ... [2018-11-10 13:10:25,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:25" (1/1) ... [2018-11-10 13:10:25,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:25" (1/1) ... [2018-11-10 13:10:25,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:25" (1/1) ... [2018-11-10 13:10:25,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:25" (1/1) ... [2018-11-10 13:10:25,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:10:25,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:10:25,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:10:25,372 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:10:25,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c22dd50-5630-4ad9-aa17-79f6c45c5471/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 13:10:25,422 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 13:10:25,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:10:25,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:10:26,777 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:10:26,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:10:26 BoogieIcfgContainer [2018-11-10 13:10:26,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:10:26,778 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 13:10:26,778 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 13:10:26,785 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 13:10:26,786 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:10:26" (1/1) ... [2018-11-10 13:10:26,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:10:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:26,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 77 states and 146 transitions. [2018-11-10 13:10:26,819 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 146 transitions. [2018-11-10 13:10:26,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 13:10:26,822 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:27,045 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 13:10:27,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:27,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 147 states and 234 transitions. [2018-11-10 13:10:27,453 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 234 transitions. [2018-11-10 13:10:27,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 13:10:27,455 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:27,544 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 13:10:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 212 states and 322 transitions. [2018-11-10 13:10:27,882 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 322 transitions. [2018-11-10 13:10:27,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 13:10:27,884 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:27,913 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:10:27,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:27,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 217 states and 330 transitions. [2018-11-10 13:10:27,989 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 330 transitions. [2018-11-10 13:10:27,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 13:10:27,993 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:28,056 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 13:10:28,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:28,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 288 states and 404 transitions. [2018-11-10 13:10:28,453 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 404 transitions. [2018-11-10 13:10:28,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 13:10:28,454 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:10:28,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:28,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 289 states and 405 transitions. [2018-11-10 13:10:28,525 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 405 transitions. [2018-11-10 13:10:28,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 13:10:28,529 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:28,578 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 13:10:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:28,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 302 states and 425 transitions. [2018-11-10 13:10:28,881 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 425 transitions. [2018-11-10 13:10:28,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 13:10:28,882 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:28,979 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:10:29,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:29,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 317 states and 443 transitions. [2018-11-10 13:10:29,287 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 443 transitions. [2018-11-10 13:10:29,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 13:10:29,288 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:29,345 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:10:29,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:29,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 326 states and 456 transitions. [2018-11-10 13:10:29,545 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 456 transitions. [2018-11-10 13:10:29,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 13:10:29,546 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:29,572 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:10:29,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:29,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 329 states and 459 transitions. [2018-11-10 13:10:29,676 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 459 transitions. [2018-11-10 13:10:29,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 13:10:29,677 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:29,703 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:10:29,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:29,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 333 states and 464 transitions. [2018-11-10 13:10:29,886 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 464 transitions. [2018-11-10 13:10:29,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 13:10:29,887 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:29,999 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:10:30,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:30,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 349 states and 486 transitions. [2018-11-10 13:10:30,473 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 486 transitions. [2018-11-10 13:10:30,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 13:10:30,474 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:30,501 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:10:30,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:30,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 356 states and 495 transitions. [2018-11-10 13:10:30,849 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 495 transitions. [2018-11-10 13:10:30,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 13:10:30,850 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:30,873 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:10:30,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 361 states and 500 transitions. [2018-11-10 13:10:30,902 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 500 transitions. [2018-11-10 13:10:30,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 13:10:30,903 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:30,923 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:10:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:31,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 366 states and 506 transitions. [2018-11-10 13:10:31,001 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 506 transitions. [2018-11-10 13:10:31,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-10 13:10:31,002 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:31,054 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:10:31,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:31,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 384 states and 526 transitions. [2018-11-10 13:10:31,323 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 526 transitions. [2018-11-10 13:10:31,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-10 13:10:31,324 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:31,347 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 13:10:31,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:31,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 390 states and 533 transitions. [2018-11-10 13:10:31,383 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 533 transitions. [2018-11-10 13:10:31,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-10 13:10:31,384 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:31,407 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:10:31,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:31,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 401 states and 547 transitions. [2018-11-10 13:10:31,577 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 547 transitions. [2018-11-10 13:10:31,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 13:10:31,578 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:31,603 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:10:31,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:31,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 408 states and 555 transitions. [2018-11-10 13:10:31,732 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 555 transitions. [2018-11-10 13:10:31,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-10 13:10:31,733 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:31,756 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:10:31,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:31,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 409 states and 557 transitions. [2018-11-10 13:10:31,962 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 557 transitions. [2018-11-10 13:10:31,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-10 13:10:31,963 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:31,985 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:10:32,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:32,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 410 states and 559 transitions. [2018-11-10 13:10:32,156 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 559 transitions. [2018-11-10 13:10:32,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 13:10:32,157 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:32,243 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:10:32,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:32,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 424 states and 574 transitions. [2018-11-10 13:10:32,537 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 574 transitions. [2018-11-10 13:10:32,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-10 13:10:32,538 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:32,567 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:10:32,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:32,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 433 states and 583 transitions. [2018-11-10 13:10:32,846 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 583 transitions. [2018-11-10 13:10:32,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-10 13:10:32,847 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:32,870 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:10:32,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:32,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 440 states and 589 transitions. [2018-11-10 13:10:32,983 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 589 transitions. [2018-11-10 13:10:32,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 13:10:32,983 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:32,999 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:10:33,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:33,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 445 states and 594 transitions. [2018-11-10 13:10:33,018 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 594 transitions. [2018-11-10 13:10:33,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 13:10:33,019 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:33,033 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:10:33,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:33,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 450 states and 600 transitions. [2018-11-10 13:10:33,141 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 600 transitions. [2018-11-10 13:10:33,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 13:10:33,142 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:33,353 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:10:33,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:33,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 457 states and 610 transitions. [2018-11-10 13:10:33,844 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 610 transitions. [2018-11-10 13:10:33,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 13:10:33,845 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:33,862 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:10:33,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:33,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 464 states and 617 transitions. [2018-11-10 13:10:33,887 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 617 transitions. [2018-11-10 13:10:33,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 13:10:33,888 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:10:33,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:33,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 471 states and 624 transitions. [2018-11-10 13:10:33,940 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 624 transitions. [2018-11-10 13:10:33,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 13:10:33,940 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:34,072 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:10:34,595 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-11-10 13:10:34,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 491 states and 646 transitions. [2018-11-10 13:10:34,946 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 646 transitions. [2018-11-10 13:10:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 13:10:34,947 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:34,965 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:10:34,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:34,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 493 states and 648 transitions. [2018-11-10 13:10:34,979 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 648 transitions. [2018-11-10 13:10:34,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 13:10:34,981 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:10:35,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:35,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 495 states and 650 transitions. [2018-11-10 13:10:35,013 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 650 transitions. [2018-11-10 13:10:35,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 13:10:35,014 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:35,087 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:10:35,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:35,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 525 states and 687 transitions. [2018-11-10 13:10:35,805 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 687 transitions. [2018-11-10 13:10:35,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 13:10:35,806 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:35,900 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:10:36,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 531 states and 696 transitions. [2018-11-10 13:10:36,083 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 696 transitions. [2018-11-10 13:10:36,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 13:10:36,083 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:36,101 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:10:36,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:36,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 535 states and 701 transitions. [2018-11-10 13:10:36,134 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 701 transitions. [2018-11-10 13:10:36,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 13:10:36,135 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:36,158 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:10:36,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:36,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 548 states and 716 transitions. [2018-11-10 13:10:36,587 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 716 transitions. [2018-11-10 13:10:36,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 13:10:36,588 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:36,649 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:10:36,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:36,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 553 states and 725 transitions. [2018-11-10 13:10:36,939 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 725 transitions. [2018-11-10 13:10:36,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-10 13:10:36,940 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:36,971 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 13:10:37,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:37,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 559 states and 731 transitions. [2018-11-10 13:10:37,002 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 731 transitions. [2018-11-10 13:10:37,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 13:10:37,003 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:37,029 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:10:37,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:37,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 568 states and 740 transitions. [2018-11-10 13:10:37,365 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 740 transitions. [2018-11-10 13:10:37,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 13:10:37,366 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:37,384 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:10:37,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:37,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 571 states and 742 transitions. [2018-11-10 13:10:37,403 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 742 transitions. [2018-11-10 13:10:37,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-10 13:10:37,404 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:37,502 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:10:38,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:38,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 598 states and 785 transitions. [2018-11-10 13:10:38,794 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 785 transitions. [2018-11-10 13:10:38,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 13:10:38,795 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:38,900 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:10:39,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:39,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 615 states and 807 transitions. [2018-11-10 13:10:39,560 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 807 transitions. [2018-11-10 13:10:39,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-10 13:10:39,561 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:39,594 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:10:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:39,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 627 states and 819 transitions. [2018-11-10 13:10:39,651 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 819 transitions. [2018-11-10 13:10:39,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-10 13:10:39,652 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:39,711 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:10:39,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:39,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 639 states and 832 transitions. [2018-11-10 13:10:39,853 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 832 transitions. [2018-11-10 13:10:39,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 13:10:39,854 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:39,981 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:10:40,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:40,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 650 states and 853 transitions. [2018-11-10 13:10:40,690 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 853 transitions. [2018-11-10 13:10:40,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 13:10:40,691 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:40,715 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:10:40,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:40,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 653 states and 856 transitions. [2018-11-10 13:10:40,860 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 856 transitions. [2018-11-10 13:10:40,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 13:10:40,860 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:40,882 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 13:10:41,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:41,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 660 states and 864 transitions. [2018-11-10 13:10:41,064 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 864 transitions. [2018-11-10 13:10:41,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 13:10:41,065 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:41,090 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:10:41,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:41,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 679 states and 886 transitions. [2018-11-10 13:10:41,277 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 886 transitions. [2018-11-10 13:10:41,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 13:10:41,277 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:10:42,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:42,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 729 states and 942 transitions. [2018-11-10 13:10:42,168 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 942 transitions. [2018-11-10 13:10:42,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 13:10:42,168 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:10:43,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:43,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 773 states and 988 transitions. [2018-11-10 13:10:43,032 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 988 transitions. [2018-11-10 13:10:43,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 13:10:43,033 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:43,125 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 13:10:43,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 778 states and 995 transitions. [2018-11-10 13:10:43,322 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 995 transitions. [2018-11-10 13:10:43,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 13:10:43,322 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:43,349 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:10:43,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:43,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 780 states and 996 transitions. [2018-11-10 13:10:43,570 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 996 transitions. [2018-11-10 13:10:43,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 13:10:43,571 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:43,601 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:10:44,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:44,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 790 states and 1010 transitions. [2018-11-10 13:10:44,255 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1010 transitions. [2018-11-10 13:10:44,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 13:10:44,256 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:44,287 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:10:44,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 792 states and 1012 transitions. [2018-11-10 13:10:44,570 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1012 transitions. [2018-11-10 13:10:44,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 13:10:44,571 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:44,637 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 13:10:44,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:44,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 794 states and 1014 transitions. [2018-11-10 13:10:44,975 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1014 transitions. [2018-11-10 13:10:44,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 13:10:44,976 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:45,084 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-10 13:10:45,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:45,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 879 states and 1107 transitions. [2018-11-10 13:10:45,780 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1107 transitions. [2018-11-10 13:10:45,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-10 13:10:45,781 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:45,804 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 13:10:46,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:46,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 893 states and 1127 transitions. [2018-11-10 13:10:46,497 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1127 transitions. [2018-11-10 13:10:46,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 13:10:46,498 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:46,520 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 13:10:46,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:46,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 895 states and 1129 transitions. [2018-11-10 13:10:46,718 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1129 transitions. [2018-11-10 13:10:46,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 13:10:46,719 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:46,751 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:10:47,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 923 states and 1162 transitions. [2018-11-10 13:10:47,273 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1162 transitions. [2018-11-10 13:10:47,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-10 13:10:47,273 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:47,350 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 13:10:47,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:47,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 924 states and 1164 transitions. [2018-11-10 13:10:47,368 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1164 transitions. [2018-11-10 13:10:47,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-10 13:10:47,369 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:47,439 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 13:10:47,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:47,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 925 states and 1165 transitions. [2018-11-10 13:10:47,453 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1165 transitions. [2018-11-10 13:10:47,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 13:10:47,453 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:47,501 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-10 13:10:47,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:47,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 927 states and 1166 transitions. [2018-11-10 13:10:47,576 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1166 transitions. [2018-11-10 13:10:47,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-10 13:10:47,577 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:47,607 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:10:48,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:48,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 954 states and 1197 transitions. [2018-11-10 13:10:48,137 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1197 transitions. [2018-11-10 13:10:48,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-10 13:10:48,138 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:48,168 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:10:48,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:48,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 957 states and 1200 transitions. [2018-11-10 13:10:48,283 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1200 transitions. [2018-11-10 13:10:48,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 13:10:48,284 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:48,347 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:10:49,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:49,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 988 states and 1230 transitions. [2018-11-10 13:10:49,046 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1230 transitions. [2018-11-10 13:10:49,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-10 13:10:49,064 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:49,380 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:10:50,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:50,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1016 states and 1265 transitions. [2018-11-10 13:10:50,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1265 transitions. [2018-11-10 13:10:50,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 13:10:50,632 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:50,658 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 13:10:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1027 states and 1277 transitions. [2018-11-10 13:10:50,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1277 transitions. [2018-11-10 13:10:50,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 13:10:50,700 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:50,730 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 13:10:50,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:50,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1038 states and 1289 transitions. [2018-11-10 13:10:50,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1289 transitions. [2018-11-10 13:10:50,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-10 13:10:50,813 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:50,855 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 13:10:50,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:50,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1039 states and 1290 transitions. [2018-11-10 13:10:50,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1290 transitions. [2018-11-10 13:10:50,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-10 13:10:50,882 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 13:10:50,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:50,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1040 states and 1291 transitions. [2018-11-10 13:10:50,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1291 transitions. [2018-11-10 13:10:50,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-10 13:10:50,938 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:51,010 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-10 13:10:52,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:52,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1061 states and 1318 transitions. [2018-11-10 13:10:52,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1318 transitions. [2018-11-10 13:10:52,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 13:10:52,198 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 13:10:52,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:52,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1062 states and 1319 transitions. [2018-11-10 13:10:52,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1319 transitions. [2018-11-10 13:10:52,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 13:10:52,279 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:52,336 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 13:10:52,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:52,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1117 states and 1376 transitions. [2018-11-10 13:10:52,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1376 transitions. [2018-11-10 13:10:52,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-10 13:10:52,750 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:52,936 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 13:10:53,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:53,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1128 states and 1400 transitions. [2018-11-10 13:10:53,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1400 transitions. [2018-11-10 13:10:53,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-10 13:10:53,906 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:53,943 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 13:10:54,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:54,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1131 states and 1403 transitions. [2018-11-10 13:10:54,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1403 transitions. [2018-11-10 13:10:54,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-10 13:10:54,145 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 13:10:55,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:55,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1197 states and 1479 transitions. [2018-11-10 13:10:55,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1479 transitions. [2018-11-10 13:10:55,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-10 13:10:55,991 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:56,074 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 13:10:56,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:56,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1214 states and 1501 transitions. [2018-11-10 13:10:56,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1501 transitions. [2018-11-10 13:10:56,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-10 13:10:56,618 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:56,679 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 13:10:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:56,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1217 states and 1503 transitions. [2018-11-10 13:10:56,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1503 transitions. [2018-11-10 13:10:56,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-10 13:10:56,880 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:56,907 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 13:10:57,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:57,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1226 states and 1513 transitions. [2018-11-10 13:10:57,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1513 transitions. [2018-11-10 13:10:57,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-10 13:10:57,223 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:57,342 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 13:10:57,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:57,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1232 states and 1525 transitions. [2018-11-10 13:10:57,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1525 transitions. [2018-11-10 13:10:57,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-10 13:10:57,795 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:57,918 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:10:58,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:58,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1240 states and 1538 transitions. [2018-11-10 13:10:58,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1538 transitions. [2018-11-10 13:10:58,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-10 13:10:58,348 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:10:58,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:58,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1251 states and 1551 transitions. [2018-11-10 13:10:58,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1551 transitions. [2018-11-10 13:10:58,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-10 13:10:58,952 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:59,021 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:10:59,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:59,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1255 states and 1559 transitions. [2018-11-10 13:10:59,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1559 transitions. [2018-11-10 13:10:59,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-10 13:10:59,165 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:59,190 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-10 13:10:59,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:59,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1278 states and 1582 transitions. [2018-11-10 13:10:59,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1582 transitions. [2018-11-10 13:10:59,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-10 13:10:59,525 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:10:59,558 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 13:10:59,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:10:59,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1285 states and 1588 transitions. [2018-11-10 13:10:59,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1588 transitions. [2018-11-10 13:10:59,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-10 13:10:59,899 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:10:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:00,582 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:11:04,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:04,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1337 states and 1660 transitions. [2018-11-10 13:11:04,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1660 transitions. [2018-11-10 13:11:04,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-10 13:11:04,327 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:04,424 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 94 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:11:04,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:04,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1344 states and 1669 transitions. [2018-11-10 13:11:04,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1669 transitions. [2018-11-10 13:11:04,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-10 13:11:04,957 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:05,168 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 13:11:06,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:06,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1354 states and 1685 transitions. [2018-11-10 13:11:06,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1685 transitions. [2018-11-10 13:11:06,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-10 13:11:06,130 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:06,168 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 13:11:06,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:06,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1412 states and 1744 transitions. [2018-11-10 13:11:06,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 1744 transitions. [2018-11-10 13:11:06,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-10 13:11:06,626 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:06,664 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 13:11:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:07,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1469 states and 1804 transitions. [2018-11-10 13:11:07,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 1804 transitions. [2018-11-10 13:11:07,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-10 13:11:07,284 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:07,372 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:11:07,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:07,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1473 states and 1808 transitions. [2018-11-10 13:11:07,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 1808 transitions. [2018-11-10 13:11:07,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-11-10 13:11:07,402 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:07,431 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-10 13:11:08,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:08,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1488 states and 1829 transitions. [2018-11-10 13:11:08,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1829 transitions. [2018-11-10 13:11:08,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-10 13:11:08,504 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:08,547 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:11:09,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:09,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1517 states and 1862 transitions. [2018-11-10 13:11:09,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1862 transitions. [2018-11-10 13:11:09,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-10 13:11:09,372 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:09,399 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:11:09,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:09,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1521 states and 1867 transitions. [2018-11-10 13:11:09,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1867 transitions. [2018-11-10 13:11:09,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-10 13:11:09,422 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:09,448 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:11:09,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:09,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1528 states and 1874 transitions. [2018-11-10 13:11:09,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 1874 transitions. [2018-11-10 13:11:09,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-10 13:11:09,930 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:10,367 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-10 13:11:11,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1533 states and 1885 transitions. [2018-11-10 13:11:11,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1885 transitions. [2018-11-10 13:11:11,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-10 13:11:11,456 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:11,639 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-10 13:11:11,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:11,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1536 states and 1889 transitions. [2018-11-10 13:11:11,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 1889 transitions. [2018-11-10 13:11:11,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-10 13:11:11,906 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:11,938 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 13:11:14,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1573 states and 1930 transitions. [2018-11-10 13:11:14,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1930 transitions. [2018-11-10 13:11:14,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-10 13:11:14,035 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:14,063 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 13:11:14,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:14,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1578 states and 1935 transitions. [2018-11-10 13:11:14,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 1935 transitions. [2018-11-10 13:11:14,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 13:11:14,334 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:14,363 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-10 13:11:15,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:15,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1591 states and 1950 transitions. [2018-11-10 13:11:15,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 1950 transitions. [2018-11-10 13:11:15,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-10 13:11:15,376 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:15,407 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-10 13:11:15,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:15,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1596 states and 1956 transitions. [2018-11-10 13:11:15,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 1956 transitions. [2018-11-10 13:11:15,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-10 13:11:15,692 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:15,729 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 13:11:15,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:15,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1615 states and 1975 transitions. [2018-11-10 13:11:15,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 1975 transitions. [2018-11-10 13:11:15,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-10 13:11:15,954 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:16,015 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 13:11:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:16,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1630 states and 1994 transitions. [2018-11-10 13:11:16,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 1994 transitions. [2018-11-10 13:11:16,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-10 13:11:16,572 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:16,637 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 13:11:16,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1632 states and 1995 transitions. [2018-11-10 13:11:16,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 1995 transitions. [2018-11-10 13:11:16,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-10 13:11:16,768 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:16,829 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 13:11:17,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:17,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 1642 states and 2005 transitions. [2018-11-10 13:11:17,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2005 transitions. [2018-11-10 13:11:17,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-10 13:11:17,077 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:17,105 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-10 13:11:17,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:17,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 1652 states and 2017 transitions. [2018-11-10 13:11:17,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2017 transitions. [2018-11-10 13:11:17,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-10 13:11:17,472 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:17,499 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:11:17,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:17,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2023 states to 1657 states and 2023 transitions. [2018-11-10 13:11:17,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2023 transitions. [2018-11-10 13:11:17,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-10 13:11:17,837 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 13:11:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:18,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 1667 states and 2036 transitions. [2018-11-10 13:11:18,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2036 transitions. [2018-11-10 13:11:18,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-10 13:11:18,458 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:18,509 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 13:11:18,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:18,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 1668 states and 2037 transitions. [2018-11-10 13:11:18,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2037 transitions. [2018-11-10 13:11:18,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 13:11:18,768 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:18,795 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 13:11:19,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:19,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 1681 states and 2051 transitions. [2018-11-10 13:11:19,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1681 states and 2051 transitions. [2018-11-10 13:11:19,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 13:11:19,086 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:19,114 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 13:11:19,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:19,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 1682 states and 2052 transitions. [2018-11-10 13:11:19,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2052 transitions. [2018-11-10 13:11:19,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 13:11:19,376 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:19,410 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-10 13:11:19,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:19,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 1687 states and 2057 transitions. [2018-11-10 13:11:19,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1687 states and 2057 transitions. [2018-11-10 13:11:19,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 13:11:19,599 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-10 13:11:20,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:20,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 1775 states and 2148 transitions. [2018-11-10 13:11:20,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2148 transitions. [2018-11-10 13:11:20,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 13:11:20,593 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:20,622 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:11:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 1777 states and 2149 transitions. [2018-11-10 13:11:21,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2149 transitions. [2018-11-10 13:11:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 13:11:21,155 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:21,251 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 191 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-10 13:11:21,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:21,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 1801 states and 2174 transitions. [2018-11-10 13:11:21,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2174 transitions. [2018-11-10 13:11:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 13:11:21,788 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:21,835 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 113 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 13:11:23,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:23,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 1832 states and 2221 transitions. [2018-11-10 13:11:23,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2221 transitions. [2018-11-10 13:11:23,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 13:11:23,570 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 113 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 13:11:23,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 1837 states and 2225 transitions. [2018-11-10 13:11:23,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2225 transitions. [2018-11-10 13:11:23,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 13:11:23,918 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:23,993 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 113 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 13:11:24,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 1844 states and 2232 transitions. [2018-11-10 13:11:24,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2232 transitions. [2018-11-10 13:11:24,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 13:11:24,310 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:24,403 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-10 13:11:25,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:25,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 1869 states and 2264 transitions. [2018-11-10 13:11:25,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2264 transitions. [2018-11-10 13:11:25,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 13:11:25,360 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:25,394 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 13:11:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:25,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 1881 states and 2278 transitions. [2018-11-10 13:11:25,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 2278 transitions. [2018-11-10 13:11:25,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 13:11:25,877 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:25,911 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 13:11:25,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:25,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 1882 states and 2279 transitions. [2018-11-10 13:11:25,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2279 transitions. [2018-11-10 13:11:25,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-10 13:11:25,947 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:26,244 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-10 13:11:26,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:26,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 1883 states and 2281 transitions. [2018-11-10 13:11:26,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 2281 transitions. [2018-11-10 13:11:26,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-10 13:11:26,268 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:26,341 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 13:11:27,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:27,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 1907 states and 2308 transitions. [2018-11-10 13:11:27,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2308 transitions. [2018-11-10 13:11:27,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-10 13:11:27,571 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:27,635 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 13:11:28,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:28,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 1917 states and 2318 transitions. [2018-11-10 13:11:28,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 2318 transitions. [2018-11-10 13:11:28,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-10 13:11:28,377 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:29,492 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 13:11:32,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:32,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 1965 states and 2366 transitions. [2018-11-10 13:11:32,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2366 transitions. [2018-11-10 13:11:32,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-10 13:11:32,701 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:32,739 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:11:33,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:33,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 1980 states and 2385 transitions. [2018-11-10 13:11:33,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 2385 transitions. [2018-11-10 13:11:33,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-10 13:11:33,323 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:33,369 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:11:35,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:35,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2011 states and 2416 transitions. [2018-11-10 13:11:35,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2416 transitions. [2018-11-10 13:11:35,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-10 13:11:35,566 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:35,602 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 13:11:36,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:36,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2071 states and 2478 transitions. [2018-11-10 13:11:36,708 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 2478 transitions. [2018-11-10 13:11:36,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-10 13:11:36,710 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:36,745 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-10 13:11:36,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:36,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 2084 states and 2490 transitions. [2018-11-10 13:11:36,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2490 transitions. [2018-11-10 13:11:36,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-10 13:11:36,925 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 111 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 13:11:38,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:38,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2115 states and 2520 transitions. [2018-11-10 13:11:38,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2520 transitions. [2018-11-10 13:11:38,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-10 13:11:38,273 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-11-10 13:11:38,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:38,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2139 states and 2545 transitions. [2018-11-10 13:11:38,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2545 transitions. [2018-11-10 13:11:38,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-10 13:11:38,906 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:39,791 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 178 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:11:42,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:42,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2217 states and 2635 transitions. [2018-11-10 13:11:42,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 2635 transitions. [2018-11-10 13:11:42,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-10 13:11:42,612 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:43,321 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 191 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:11:45,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:45,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2229 states and 2655 transitions. [2018-11-10 13:11:45,028 INFO L276 IsEmpty]: Start isEmpty. Operand 2229 states and 2655 transitions. [2018-11-10 13:11:45,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-10 13:11:45,030 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:11:45,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:45,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2236 states and 2666 transitions. [2018-11-10 13:11:45,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2666 transitions. [2018-11-10 13:11:45,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-10 13:11:45,177 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:46,045 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 203 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:11:47,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:47,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2248 states and 2683 transitions. [2018-11-10 13:11:47,939 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 2683 transitions. [2018-11-10 13:11:47,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-10 13:11:47,939 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:48,286 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 175 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:11:50,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:50,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2766 states to 2323 states and 2766 transitions. [2018-11-10 13:11:50,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 2766 transitions. [2018-11-10 13:11:50,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-10 13:11:50,630 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:50,683 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-10 13:11:51,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:51,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2780 states to 2332 states and 2780 transitions. [2018-11-10 13:11:51,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 2780 transitions. [2018-11-10 13:11:51,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-10 13:11:51,693 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:51,728 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-10 13:11:52,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:52,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2783 states to 2335 states and 2783 transitions. [2018-11-10 13:11:52,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 2783 transitions. [2018-11-10 13:11:52,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-10 13:11:52,073 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-11-10 13:11:53,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:53,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2359 states and 2809 transitions. [2018-11-10 13:11:53,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 2809 transitions. [2018-11-10 13:11:53,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-10 13:11:53,076 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-11-10 13:11:53,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:53,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2816 states to 2366 states and 2816 transitions. [2018-11-10 13:11:53,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 2816 transitions. [2018-11-10 13:11:53,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-10 13:11:53,786 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:53,827 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-10 13:11:54,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:54,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2437 states and 2890 transitions. [2018-11-10 13:11:54,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 2890 transitions. [2018-11-10 13:11:54,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-10 13:11:54,856 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:54,912 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-10 13:11:57,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:57,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2495 states and 2951 transitions. [2018-11-10 13:11:57,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 2951 transitions. [2018-11-10 13:11:57,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-10 13:11:57,740 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:57,815 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-10 13:11:58,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:11:58,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2516 states and 2971 transitions. [2018-11-10 13:11:58,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2516 states and 2971 transitions. [2018-11-10 13:11:58,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-10 13:11:58,093 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:11:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:11:58,191 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-11-10 13:12:00,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:12:00,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3011 states to 2548 states and 3011 transitions. [2018-11-10 13:12:00,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 3011 transitions. [2018-11-10 13:12:00,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-10 13:12:00,098 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:12:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:12:00,187 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-11-10 13:12:00,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:12:00,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3024 states to 2562 states and 3024 transitions. [2018-11-10 13:12:00,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 3024 transitions. [2018-11-10 13:12:00,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-10 13:12:00,736 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:12:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:12:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-11-10 13:12:02,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:12:02,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 2630 states and 3096 transitions. [2018-11-10 13:12:02,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3096 transitions. [2018-11-10 13:12:02,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-10 13:12:02,544 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:12:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:12:02,637 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-11-10 13:12:03,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:12:03,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 2641 states and 3106 transitions. [2018-11-10 13:12:03,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2641 states and 3106 transitions. [2018-11-10 13:12:03,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-10 13:12:03,099 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:12:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:12:03,189 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-11-10 13:12:03,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:12:03,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 2643 states and 3108 transitions. [2018-11-10 13:12:03,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 3108 transitions. [2018-11-10 13:12:03,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-10 13:12:03,468 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:12:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:12:03,556 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-11-10 13:12:03,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:12:03,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 2644 states and 3108 transitions. [2018-11-10 13:12:03,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3108 transitions. [2018-11-10 13:12:03,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-10 13:12:03,774 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:12:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:12:03,831 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-11-10 13:12:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:12:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 2657 states and 3122 transitions. [2018-11-10 13:12:04,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 3122 transitions. [2018-11-10 13:12:04,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-10 13:12:04,749 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:12:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:12:04,806 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-11-10 13:12:05,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:12:05,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 2659 states and 3123 transitions. [2018-11-10 13:12:05,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2659 states and 3123 transitions. [2018-11-10 13:12:05,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-10 13:12:05,208 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:12:05,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:12:05,616 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 303 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:12:06,458 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-11-10 13:12:09,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:12:09,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3190 states to 2709 states and 3190 transitions. [2018-11-10 13:12:09,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2709 states and 3190 transitions. [2018-11-10 13:12:09,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-10 13:12:09,512 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:12:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:12:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 303 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:12:10,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:12:10,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3198 states to 2717 states and 3198 transitions. [2018-11-10 13:12:10,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 3198 transitions. [2018-11-10 13:12:10,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-10 13:12:10,759 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:12:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:12:10,846 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 303 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:12:11,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:12:11,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 2721 states and 3205 transitions. [2018-11-10 13:12:11,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2721 states and 3205 transitions. [2018-11-10 13:12:11,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-10 13:12:11,620 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:12:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:12:11,720 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 303 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:12:12,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:12:12,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 2748 states and 3234 transitions. [2018-11-10 13:12:12,918 INFO L276 IsEmpty]: Start isEmpty. Operand 2748 states and 3234 transitions. [2018-11-10 13:12:12,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-10 13:12:12,919 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:12:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:12:13,001 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 303 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:12:13,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:12:13,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3235 states to 2750 states and 3235 transitions. [2018-11-10 13:12:13,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 3235 transitions. [2018-11-10 13:12:13,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-10 13:12:13,423 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:12:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:12:13,833 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 161 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:12:16,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:12:16,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3283 states to 2792 states and 3283 transitions. [2018-11-10 13:12:16,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2792 states and 3283 transitions. [2018-11-10 13:12:16,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-10 13:12:16,975 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:12:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:12:17,086 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 161 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:12:17,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:12:17,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3287 states to 2797 states and 3287 transitions. [2018-11-10 13:12:17,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 3287 transitions. [2018-11-10 13:12:17,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-10 13:12:17,573 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:12:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:12:17,676 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 161 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:12:18,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:12:18,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 2812 states and 3306 transitions. [2018-11-10 13:12:18,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 3306 transitions. [2018-11-10 13:12:18,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-10 13:12:18,572 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:12:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:12:18,800 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 161 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:12:19,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:12:19,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 2814 states and 3308 transitions. [2018-11-10 13:12:19,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2814 states and 3308 transitions. [2018-11-10 13:12:19,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-11-10 13:12:19,227 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:12:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:12:19,989 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 74 proven. 194 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-10 13:12:21,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 13:12:21,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3325 states to 2825 states and 3325 transitions. [2018-11-10 13:12:21,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3325 transitions. [2018-11-10 13:12:21,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-11-10 13:12:21,445 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 13:12:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:12:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:12:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:12:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:12:21,658 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 161 iterations. [2018-11-10 13:12:21,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 01:12:21 ImpRootNode [2018-11-10 13:12:21,803 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 13:12:21,803 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:12:21,803 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:12:21,803 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:12:21,805 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:10:26" (3/4) ... [2018-11-10 13:12:21,808 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 13:12:21,922 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3c22dd50-5630-4ad9-aa17-79f6c45c5471/bin-2019/ukojak/witness.graphml [2018-11-10 13:12:21,922 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:12:21,923 INFO L168 Benchmark]: Toolchain (without parser) took 117056.97 ms. Allocated memory was 1.0 GB in the beginning and 3.6 GB in the end (delta: 2.6 GB). Free memory was 951.1 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-11-10 13:12:21,923 INFO L168 Benchmark]: CDTParser took 0.16 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 13:12:21,924 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.77 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 916.2 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:12:21,924 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 916.2 MB in the beginning and 1.1 GB in the end (delta: -222.8 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:12:21,924 INFO L168 Benchmark]: Boogie Preprocessor took 42.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:12:21,924 INFO L168 Benchmark]: RCFGBuilder took 1405.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 898.5 MB in the end (delta: 235.8 MB). Peak memory consumption was 235.8 MB. Max. memory is 11.5 GB. [2018-11-10 13:12:21,924 INFO L168 Benchmark]: CodeCheck took 115024.61 ms. Allocated memory was 1.2 GB in the beginning and 3.6 GB in the end (delta: 2.4 GB). Free memory was 898.5 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-11-10 13:12:21,925 INFO L168 Benchmark]: Witness Printer took 119.22 ms. Allocated memory is still 3.6 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:12:21,926 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, 114.8s OverallTime, 161 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1818363972 SDtfs, -2098455136 SDslu, 1662009888 SDs, 0 SdLazy, 692672308 SolverSat, -186891660 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 534.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 167426 GetRequests, 163668 SyntacticMatches, 2328 SemanticMatches, 1430 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1454136 ImplicationChecksByTransitivity, 97.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.5s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 24850 NumberOfCodeBlocks, 24850 NumberOfCodeBlocksAsserted, 161 NumberOfCheckSat, 24450 ConstructedInterpolants, 0 QuantifiedInterpolants, 12681370 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 160 InterpolantComputations, 130 PerfectInterpolantSequences, 19383/20367 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: 422]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] RET return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] RET return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] RET return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND TRUE (((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8)) [L279] a20 = 1 [L280] a8 = 13 [L281] a16 = 4 [L282] a7 = 0 [L283] a21 = 1 [L284] a17 = 0 [L285] RET return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] 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=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L412] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L415] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))) [L418] COND FALSE !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L421] COND TRUE ((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L422] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 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 357.77 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 916.2 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 103.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 916.2 MB in the beginning and 1.1 GB in the end (delta: -222.8 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1405.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 898.5 MB in the end (delta: 235.8 MB). Peak memory consumption was 235.8 MB. Max. memory is 11.5 GB. * CodeCheck took 115024.61 ms. Allocated memory was 1.2 GB in the beginning and 3.6 GB in the end (delta: 2.4 GB). Free memory was 898.5 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 119.22 ms. Allocated memory is still 3.6 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...