./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label50_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_8d9a51f7-c4a8-4680-8a63-71f24e21f3f4/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8d9a51f7-c4a8-4680-8a63-71f24e21f3f4/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8d9a51f7-c4a8-4680-8a63-71f24e21f3f4/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8d9a51f7-c4a8-4680-8a63-71f24e21f3f4/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label50_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8d9a51f7-c4a8-4680-8a63-71f24e21f3f4/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8d9a51f7-c4a8-4680-8a63-71f24e21f3f4/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 bef46999e9dea747e943c0e8bab6fd45498a6f2f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 05:36:32,297 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:36:32,299 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:36:32,307 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:36:32,307 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:36:32,308 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:36:32,308 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:36:32,310 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:36:32,311 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:36:32,311 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:36:32,312 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:36:32,312 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:36:32,313 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:36:32,313 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:36:32,314 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:36:32,315 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:36:32,315 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:36:32,316 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:36:32,317 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:36:32,318 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:36:32,319 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:36:32,320 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:36:32,321 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:36:32,321 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:36:32,321 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:36:32,322 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:36:32,323 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:36:32,323 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:36:32,324 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:36:32,324 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:36:32,324 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:36:32,325 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:36:32,325 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:36:32,325 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:36:32,326 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:36:32,326 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:36:32,326 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8d9a51f7-c4a8-4680-8a63-71f24e21f3f4/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 05:36:32,335 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:36:32,336 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:36:32,336 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 05:36:32,336 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 05:36:32,337 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:36:32,337 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:36:32,337 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:36:32,337 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:36:32,337 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:36:32,337 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:36:32,338 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:36:32,338 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 05:36:32,338 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 05:36:32,338 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 05:36:32,338 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:36:32,338 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:36:32,338 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 05:36:32,338 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 05:36:32,339 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 05:36:32,339 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:36:32,339 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 05:36:32,339 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 05:36:32,339 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:36:32,339 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 05:36:32,339 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 05:36:32,339 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 05:36:32,340 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 05:36:32,340 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 05:36:32,340 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_8d9a51f7-c4a8-4680-8a63-71f24e21f3f4/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 -> bef46999e9dea747e943c0e8bab6fd45498a6f2f [2018-11-10 05:36:32,362 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:36:32,372 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:36:32,375 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:36:32,376 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:36:32,376 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:36:32,377 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8d9a51f7-c4a8-4680-8a63-71f24e21f3f4/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label50_false-unreach-call_false-termination.c [2018-11-10 05:36:32,421 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8d9a51f7-c4a8-4680-8a63-71f24e21f3f4/bin-2019/ukojak/data/78ff5e51e/750dbeea4ae64839bd3adaf06bee6bc5/FLAG30f3833e3 [2018-11-10 05:36:32,865 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:36:32,866 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8d9a51f7-c4a8-4680-8a63-71f24e21f3f4/sv-benchmarks/c/eca-rers2012/Problem01_label50_false-unreach-call_false-termination.c [2018-11-10 05:36:32,874 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8d9a51f7-c4a8-4680-8a63-71f24e21f3f4/bin-2019/ukojak/data/78ff5e51e/750dbeea4ae64839bd3adaf06bee6bc5/FLAG30f3833e3 [2018-11-10 05:36:32,886 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8d9a51f7-c4a8-4680-8a63-71f24e21f3f4/bin-2019/ukojak/data/78ff5e51e/750dbeea4ae64839bd3adaf06bee6bc5 [2018-11-10 05:36:32,889 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:36:32,890 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:36:32,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:36:32,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:36:32,893 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:36:32,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:36:32" (1/1) ... [2018-11-10 05:36:32,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18da3d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:36:32, skipping insertion in model container [2018-11-10 05:36:32,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:36:32" (1/1) ... [2018-11-10 05:36:32,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:36:32,934 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:36:33,172 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:36:33,176 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:36:33,241 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:36:33,258 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:36:33,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:36:33 WrapperNode [2018-11-10 05:36:33,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:36:33,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:36:33,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:36:33,259 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:36:33,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:36:33" (1/1) ... [2018-11-10 05:36:33,279 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:36:33" (1/1) ... [2018-11-10 05:36:33,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:36:33,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:36:33,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:36:33,362 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:36:33,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:36:33" (1/1) ... [2018-11-10 05:36:33,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:36:33" (1/1) ... [2018-11-10 05:36:33,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:36:33" (1/1) ... [2018-11-10 05:36:33,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:36:33" (1/1) ... [2018-11-10 05:36:33,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:36:33" (1/1) ... [2018-11-10 05:36:33,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:36:33" (1/1) ... [2018-11-10 05:36:33,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:36:33" (1/1) ... [2018-11-10 05:36:33,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:36:33,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:36:33,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:36:33,405 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:36:33,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:36:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8d9a51f7-c4a8-4680-8a63-71f24e21f3f4/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 05:36:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 05:36:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:36:33,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:36:35,032 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:36:35,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:36:35 BoogieIcfgContainer [2018-11-10 05:36:35,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:36:35,034 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 05:36:35,034 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 05:36:35,041 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 05:36:35,042 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:36:35" (1/1) ... [2018-11-10 05:36:35,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:36:35,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 77 states and 146 transitions. [2018-11-10 05:36:35,076 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 146 transitions. [2018-11-10 05:36:35,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 05:36:35,080 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:35,333 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 05:36:35,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:35,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 147 states and 222 transitions. [2018-11-10 05:36:35,720 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 222 transitions. [2018-11-10 05:36:35,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 05:36:35,722 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:35,835 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 05:36:36,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:36,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 218 states and 316 transitions. [2018-11-10 05:36:36,226 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 316 transitions. [2018-11-10 05:36:36,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 05:36:36,228 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:36,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:36,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:36:36,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:36,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 224 states and 327 transitions. [2018-11-10 05:36:36,394 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 327 transitions. [2018-11-10 05:36:36,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 05:36:36,395 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:36,499 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 05:36:36,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:36,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 294 states and 400 transitions. [2018-11-10 05:36:36,898 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 400 transitions. [2018-11-10 05:36:36,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 05:36:36,899 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:36,937 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:36:36,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:36,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 297 states and 404 transitions. [2018-11-10 05:36:36,956 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 404 transitions. [2018-11-10 05:36:36,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 05:36:36,957 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:37,013 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:36:37,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:37,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 309 states and 421 transitions. [2018-11-10 05:36:37,287 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 421 transitions. [2018-11-10 05:36:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 05:36:37,290 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:37,345 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:36:37,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:37,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 322 states and 439 transitions. [2018-11-10 05:36:37,627 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 439 transitions. [2018-11-10 05:36:37,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 05:36:37,628 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:37,659 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:36:37,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:37,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 323 states and 441 transitions. [2018-11-10 05:36:37,762 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 441 transitions. [2018-11-10 05:36:37,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 05:36:37,762 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:37,860 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 05:36:38,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:38,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 338 states and 461 transitions. [2018-11-10 05:36:38,211 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 461 transitions. [2018-11-10 05:36:38,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 05:36:38,212 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 05:36:38,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:38,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 339 states and 463 transitions. [2018-11-10 05:36:38,317 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 463 transitions. [2018-11-10 05:36:38,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 05:36:38,318 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:38,343 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 05:36:38,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:38,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 340 states and 465 transitions. [2018-11-10 05:36:38,430 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 465 transitions. [2018-11-10 05:36:38,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 05:36:38,431 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:38,549 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 05:36:39,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:39,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 351 states and 478 transitions. [2018-11-10 05:36:39,236 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 478 transitions. [2018-11-10 05:36:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 05:36:39,237 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:39,264 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 05:36:39,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:39,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 365 states and 495 transitions. [2018-11-10 05:36:39,511 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 495 transitions. [2018-11-10 05:36:39,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-10 05:36:39,511 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:39,535 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 05:36:39,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:39,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 383 states and 517 transitions. [2018-11-10 05:36:39,948 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 517 transitions. [2018-11-10 05:36:39,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-10 05:36:39,949 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:39,965 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:36:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 391 states and 527 transitions. [2018-11-10 05:36:40,061 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 527 transitions. [2018-11-10 05:36:40,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 05:36:40,062 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:40,082 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 05:36:40,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:40,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 392 states and 528 transitions. [2018-11-10 05:36:40,092 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 528 transitions. [2018-11-10 05:36:40,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 05:36:40,093 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:40,114 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 05:36:40,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:40,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 399 states and 535 transitions. [2018-11-10 05:36:40,211 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 535 transitions. [2018-11-10 05:36:40,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 05:36:40,212 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:40,313 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 05:36:40,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:40,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 414 states and 554 transitions. [2018-11-10 05:36:40,710 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 554 transitions. [2018-11-10 05:36:40,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-10 05:36:40,711 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:40,738 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:36:40,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 415 states and 556 transitions. [2018-11-10 05:36:40,759 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 556 transitions. [2018-11-10 05:36:40,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-10 05:36:40,760 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:40,861 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:36:41,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:41,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 423 states and 565 transitions. [2018-11-10 05:36:41,144 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 565 transitions. [2018-11-10 05:36:41,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 05:36:41,145 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:41,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:41,200 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 05:36:41,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:41,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 437 states and 584 transitions. [2018-11-10 05:36:41,433 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 584 transitions. [2018-11-10 05:36:41,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 05:36:41,434 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:41,461 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:36:41,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:41,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 438 states and 586 transitions. [2018-11-10 05:36:41,492 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 586 transitions. [2018-11-10 05:36:41,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 05:36:41,492 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:41,529 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 05:36:41,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:41,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 453 states and 603 transitions. [2018-11-10 05:36:41,920 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 603 transitions. [2018-11-10 05:36:41,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 05:36:41,921 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:41,956 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 05:36:42,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:42,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 455 states and 604 transitions. [2018-11-10 05:36:42,078 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 604 transitions. [2018-11-10 05:36:42,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 05:36:42,079 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 05:36:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:42,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 456 states and 606 transitions. [2018-11-10 05:36:42,143 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 606 transitions. [2018-11-10 05:36:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 05:36:42,143 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:42,173 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 05:36:42,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:42,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 457 states and 608 transitions. [2018-11-10 05:36:42,345 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 608 transitions. [2018-11-10 05:36:42,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 05:36:42,346 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:42,381 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:36:42,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:42,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 474 states and 627 transitions. [2018-11-10 05:36:42,923 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 627 transitions. [2018-11-10 05:36:42,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 05:36:42,923 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:36:43,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:43,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 485 states and 638 transitions. [2018-11-10 05:36:43,439 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 638 transitions. [2018-11-10 05:36:43,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 05:36:43,440 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:43,461 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 05:36:43,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:43,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 487 states and 640 transitions. [2018-11-10 05:36:43,483 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 640 transitions. [2018-11-10 05:36:43,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 05:36:43,484 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-10 05:36:43,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:43,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 488 states and 641 transitions. [2018-11-10 05:36:43,717 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 641 transitions. [2018-11-10 05:36:43,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-10 05:36:43,718 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:43,740 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 05:36:43,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:43,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 493 states and 646 transitions. [2018-11-10 05:36:43,780 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 646 transitions. [2018-11-10 05:36:43,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-10 05:36:43,780 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:36:44,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:44,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 507 states and 660 transitions. [2018-11-10 05:36:44,458 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 660 transitions. [2018-11-10 05:36:44,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 05:36:44,458 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:44,538 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 05:36:45,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:45,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 535 states and 697 transitions. [2018-11-10 05:36:45,048 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 697 transitions. [2018-11-10 05:36:45,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 05:36:45,049 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:45,080 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 05:36:45,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:45,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 536 states and 698 transitions. [2018-11-10 05:36:45,096 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 698 transitions. [2018-11-10 05:36:45,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-10 05:36:45,097 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:45,126 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 05:36:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:45,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 546 states and 708 transitions. [2018-11-10 05:36:45,194 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 708 transitions. [2018-11-10 05:36:45,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 05:36:45,195 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 05:36:45,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:45,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 554 states and 716 transitions. [2018-11-10 05:36:45,364 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 716 transitions. [2018-11-10 05:36:45,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 05:36:45,364 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:45,534 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 05:36:46,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:46,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 585 states and 754 transitions. [2018-11-10 05:36:46,585 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 754 transitions. [2018-11-10 05:36:46,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 05:36:46,586 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 05:36:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:46,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 586 states and 755 transitions. [2018-11-10 05:36:46,636 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 755 transitions. [2018-11-10 05:36:46,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 05:36:46,637 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:46,744 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 05:36:47,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:47,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 605 states and 783 transitions. [2018-11-10 05:36:47,285 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 783 transitions. [2018-11-10 05:36:47,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 05:36:47,286 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:47,307 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 05:36:47,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:47,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 614 states and 794 transitions. [2018-11-10 05:36:47,615 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 794 transitions. [2018-11-10 05:36:47,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 05:36:47,615 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:47,729 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 05:36:48,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:48,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 625 states and 817 transitions. [2018-11-10 05:36:48,316 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 817 transitions. [2018-11-10 05:36:48,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 05:36:48,316 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 05:36:48,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:48,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 628 states and 820 transitions. [2018-11-10 05:36:48,389 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 820 transitions. [2018-11-10 05:36:48,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 05:36:48,390 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:48,437 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 05:36:48,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:48,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 633 states and 826 transitions. [2018-11-10 05:36:48,607 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 826 transitions. [2018-11-10 05:36:48,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-10 05:36:48,608 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:48,633 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 05:36:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:48,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 646 states and 839 transitions. [2018-11-10 05:36:48,689 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 839 transitions. [2018-11-10 05:36:48,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-10 05:36:48,689 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:48,711 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 05:36:48,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:48,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 655 states and 848 transitions. [2018-11-10 05:36:48,761 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 848 transitions. [2018-11-10 05:36:48,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-10 05:36:48,761 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:48,781 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 05:36:48,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:48,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 656 states and 849 transitions. [2018-11-10 05:36:48,793 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 849 transitions. [2018-11-10 05:36:48,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-10 05:36:48,794 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:48,812 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 05:36:48,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:48,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 669 states and 862 transitions. [2018-11-10 05:36:48,847 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 862 transitions. [2018-11-10 05:36:48,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-10 05:36:48,847 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:49,171 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 05:36:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:50,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 718 states and 918 transitions. [2018-11-10 05:36:50,575 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 918 transitions. [2018-11-10 05:36:50,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-10 05:36:50,575 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 05:36:51,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:51,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 728 states and 939 transitions. [2018-11-10 05:36:51,925 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 939 transitions. [2018-11-10 05:36:51,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-10 05:36:51,925 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:52,268 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 05:36:55,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:55,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 785 states and 1012 transitions. [2018-11-10 05:36:55,081 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1012 transitions. [2018-11-10 05:36:55,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-10 05:36:55,082 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:55,255 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 69 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 05:36:56,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:56,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 813 states and 1041 transitions. [2018-11-10 05:36:56,173 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1041 transitions. [2018-11-10 05:36:56,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 05:36:56,174 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 05:36:58,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:58,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 858 states and 1096 transitions. [2018-11-10 05:36:58,369 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1096 transitions. [2018-11-10 05:36:58,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 05:36:58,370 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:58,426 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 05:36:58,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:36:58,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 886 states and 1123 transitions. [2018-11-10 05:36:58,954 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1123 transitions. [2018-11-10 05:36:58,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 05:36:58,955 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:36:58,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:36:59,361 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:37:00,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:00,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 903 states and 1144 transitions. [2018-11-10 05:37:00,388 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1144 transitions. [2018-11-10 05:37:00,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 05:37:00,389 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:00,445 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:37:00,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 912 states and 1154 transitions. [2018-11-10 05:37:00,682 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1154 transitions. [2018-11-10 05:37:00,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 05:37:00,683 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:00,712 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 05:37:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:00,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 917 states and 1162 transitions. [2018-11-10 05:37:00,740 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1162 transitions. [2018-11-10 05:37:00,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 05:37:00,741 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:00,765 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 05:37:01,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:01,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 930 states and 1176 transitions. [2018-11-10 05:37:01,046 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1176 transitions. [2018-11-10 05:37:01,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 05:37:01,047 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:01,112 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-10 05:37:01,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:01,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 934 states and 1186 transitions. [2018-11-10 05:37:01,308 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1186 transitions. [2018-11-10 05:37:01,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-10 05:37:01,309 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:01,336 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 05:37:01,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:01,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 943 states and 1198 transitions. [2018-11-10 05:37:01,375 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1198 transitions. [2018-11-10 05:37:01,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 05:37:01,376 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:01,412 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 05:37:01,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:01,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 947 states and 1202 transitions. [2018-11-10 05:37:01,437 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1202 transitions. [2018-11-10 05:37:01,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 05:37:01,437 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:01,502 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 70 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 05:37:01,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:01,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1016 states and 1281 transitions. [2018-11-10 05:37:01,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1281 transitions. [2018-11-10 05:37:01,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-10 05:37:01,984 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:02,010 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-10 05:37:02,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1033 states and 1303 transitions. [2018-11-10 05:37:02,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1303 transitions. [2018-11-10 05:37:02,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-10 05:37:02,469 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:02,634 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 05:37:03,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:03,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1042 states and 1321 transitions. [2018-11-10 05:37:03,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1321 transitions. [2018-11-10 05:37:03,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-10 05:37:03,552 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:03,786 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 05:37:05,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:05,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1064 states and 1348 transitions. [2018-11-10 05:37:05,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1348 transitions. [2018-11-10 05:37:05,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-10 05:37:05,366 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 05:37:06,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:06,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1075 states and 1362 transitions. [2018-11-10 05:37:06,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1362 transitions. [2018-11-10 05:37:06,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-10 05:37:06,194 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:06,302 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 05:37:06,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1084 states and 1372 transitions. [2018-11-10 05:37:06,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1372 transitions. [2018-11-10 05:37:06,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-10 05:37:06,668 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 05:37:07,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:07,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1091 states and 1378 transitions. [2018-11-10 05:37:07,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1378 transitions. [2018-11-10 05:37:07,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-10 05:37:07,057 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:07,087 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 05:37:07,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:07,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1103 states and 1390 transitions. [2018-11-10 05:37:07,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1390 transitions. [2018-11-10 05:37:07,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-10 05:37:07,123 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:07,160 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 05:37:07,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:07,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1130 states and 1426 transitions. [2018-11-10 05:37:07,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1426 transitions. [2018-11-10 05:37:07,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-10 05:37:07,827 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:07,883 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 05:37:08,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:08,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1135 states and 1430 transitions. [2018-11-10 05:37:08,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1430 transitions. [2018-11-10 05:37:08,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-10 05:37:08,174 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:08,213 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 05:37:08,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:08,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1158 states and 1455 transitions. [2018-11-10 05:37:08,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1455 transitions. [2018-11-10 05:37:08,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-10 05:37:08,906 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:08,943 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 05:37:10,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:10,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1184 states and 1486 transitions. [2018-11-10 05:37:10,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1486 transitions. [2018-11-10 05:37:10,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-10 05:37:10,343 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:10,378 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 05:37:10,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:10,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1193 states and 1496 transitions. [2018-11-10 05:37:10,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1496 transitions. [2018-11-10 05:37:10,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-10 05:37:10,840 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:10,880 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 05:37:11,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:11,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1251 states and 1558 transitions. [2018-11-10 05:37:11,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1558 transitions. [2018-11-10 05:37:11,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-10 05:37:11,290 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 103 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 05:37:13,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:13,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1318 states and 1640 transitions. [2018-11-10 05:37:13,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1640 transitions. [2018-11-10 05:37:13,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-10 05:37:13,088 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 103 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 05:37:13,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:13,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1323 states and 1645 transitions. [2018-11-10 05:37:13,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1645 transitions. [2018-11-10 05:37:13,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-10 05:37:13,359 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:13,404 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-10 05:37:13,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:13,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1324 states and 1649 transitions. [2018-11-10 05:37:13,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1649 transitions. [2018-11-10 05:37:13,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-10 05:37:13,602 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 167 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:37:17,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:17,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1360 states and 1696 transitions. [2018-11-10 05:37:17,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1696 transitions. [2018-11-10 05:37:17,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-10 05:37:17,659 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 167 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:37:18,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:18,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1363 states and 1698 transitions. [2018-11-10 05:37:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1698 transitions. [2018-11-10 05:37:18,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-10 05:37:18,283 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:18,318 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 05:37:18,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1376 states and 1714 transitions. [2018-11-10 05:37:18,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1714 transitions. [2018-11-10 05:37:18,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-10 05:37:18,619 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 05:37:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:19,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1387 states and 1724 transitions. [2018-11-10 05:37:19,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 1724 transitions. [2018-11-10 05:37:19,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-10 05:37:19,139 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:19,174 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 05:37:19,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:19,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1388 states and 1726 transitions. [2018-11-10 05:37:19,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1726 transitions. [2018-11-10 05:37:19,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-10 05:37:19,413 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 05:37:19,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:19,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1389 states and 1728 transitions. [2018-11-10 05:37:19,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1728 transitions. [2018-11-10 05:37:19,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-10 05:37:19,678 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:20,119 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 121 proven. 30 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 05:37:23,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:23,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1414 states and 1778 transitions. [2018-11-10 05:37:23,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 1778 transitions. [2018-11-10 05:37:23,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-10 05:37:23,013 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 121 proven. 30 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 05:37:23,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:23,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1427 states and 1793 transitions. [2018-11-10 05:37:23,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1793 transitions. [2018-11-10 05:37:23,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-10 05:37:23,844 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:24,009 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 121 proven. 30 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 05:37:24,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:24,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1438 states and 1804 transitions. [2018-11-10 05:37:24,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1804 transitions. [2018-11-10 05:37:24,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-10 05:37:24,331 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:24,472 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 121 proven. 30 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 05:37:24,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:24,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1441 states and 1807 transitions. [2018-11-10 05:37:24,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1807 transitions. [2018-11-10 05:37:24,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-10 05:37:24,830 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:24,956 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 121 proven. 30 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 05:37:25,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:25,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1442 states and 1809 transitions. [2018-11-10 05:37:25,329 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 1809 transitions. [2018-11-10 05:37:25,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 05:37:25,329 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:25,373 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 05:37:26,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:26,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1468 states and 1837 transitions. [2018-11-10 05:37:26,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1837 transitions. [2018-11-10 05:37:26,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-10 05:37:26,474 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:26,518 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 05:37:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:28,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1550 states and 1936 transitions. [2018-11-10 05:37:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 1936 transitions. [2018-11-10 05:37:28,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 05:37:28,502 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:29,069 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:37:31,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:31,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1561 states and 1955 transitions. [2018-11-10 05:37:31,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1955 transitions. [2018-11-10 05:37:31,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 05:37:31,936 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:32,002 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:37:33,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:33,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1573 states and 1968 transitions. [2018-11-10 05:37:33,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1968 transitions. [2018-11-10 05:37:33,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 05:37:33,435 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:33,643 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 160 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:37:36,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:36,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 1643 states and 2045 transitions. [2018-11-10 05:37:36,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2045 transitions. [2018-11-10 05:37:36,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 05:37:36,165 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:36,355 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 05:37:37,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 1648 states and 2051 transitions. [2018-11-10 05:37:37,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2051 transitions. [2018-11-10 05:37:37,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 05:37:37,182 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:37,213 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 05:37:38,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:38,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 1660 states and 2066 transitions. [2018-11-10 05:37:38,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 2066 transitions. [2018-11-10 05:37:38,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 05:37:38,196 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:38,228 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 05:37:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:38,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 1662 states and 2067 transitions. [2018-11-10 05:37:38,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2067 transitions. [2018-11-10 05:37:38,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 05:37:38,623 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:38,667 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 05:37:39,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:39,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 1666 states and 2071 transitions. [2018-11-10 05:37:39,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2071 transitions. [2018-11-10 05:37:39,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 05:37:39,642 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:39,685 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 05:37:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:40,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 1668 states and 2072 transitions. [2018-11-10 05:37:40,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2072 transitions. [2018-11-10 05:37:40,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 05:37:40,055 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 05:37:41,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:41,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 1675 states and 2082 transitions. [2018-11-10 05:37:41,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 2082 transitions. [2018-11-10 05:37:41,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 05:37:41,307 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:41,351 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 05:37:41,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:41,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 1677 states and 2083 transitions. [2018-11-10 05:37:41,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2083 transitions. [2018-11-10 05:37:41,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-10 05:37:41,720 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:41,754 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-10 05:37:42,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:42,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 1682 states and 2090 transitions. [2018-11-10 05:37:42,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2090 transitions. [2018-11-10 05:37:42,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-10 05:37:42,026 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:42,062 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-10 05:37:42,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 1683 states and 2092 transitions. [2018-11-10 05:37:42,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2092 transitions. [2018-11-10 05:37:42,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-10 05:37:42,382 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-10 05:37:45,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:45,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 1706 states and 2125 transitions. [2018-11-10 05:37:45,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2125 transitions. [2018-11-10 05:37:45,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-10 05:37:45,175 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:45,518 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-10 05:37:45,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:45,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 1708 states and 2126 transitions. [2018-11-10 05:37:45,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2126 transitions. [2018-11-10 05:37:45,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 05:37:45,958 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 123 proven. 5 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 05:37:46,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:46,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 1709 states and 2126 transitions. [2018-11-10 05:37:46,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2126 transitions. [2018-11-10 05:37:46,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-10 05:37:46,337 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:47,190 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 05:37:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 1718 states and 2139 transitions. [2018-11-10 05:37:48,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2139 transitions. [2018-11-10 05:37:48,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-10 05:37:48,985 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:49,298 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 05:37:50,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:50,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 1726 states and 2149 transitions. [2018-11-10 05:37:50,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2149 transitions. [2018-11-10 05:37:50,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-10 05:37:50,358 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:50,743 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 05:37:51,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:51,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 1727 states and 2149 transitions. [2018-11-10 05:37:51,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2149 transitions. [2018-11-10 05:37:51,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-10 05:37:51,194 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:51,463 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 198 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 05:37:53,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:53,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 1745 states and 2170 transitions. [2018-11-10 05:37:53,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2170 transitions. [2018-11-10 05:37:53,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-10 05:37:53,251 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 198 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 05:37:54,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:54,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 1772 states and 2200 transitions. [2018-11-10 05:37:54,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2200 transitions. [2018-11-10 05:37:54,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-10 05:37:54,717 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:55,317 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 280 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:37:57,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:37:57,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2227 states to 1793 states and 2227 transitions. [2018-11-10 05:37:57,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2227 transitions. [2018-11-10 05:37:57,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-10 05:37:57,724 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:37:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:37:58,956 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 05:38:02,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:38:02,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 1839 states and 2277 transitions. [2018-11-10 05:38:02,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2277 transitions. [2018-11-10 05:38:02,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-10 05:38:02,686 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:38:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:38:02,788 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 05:38:03,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:38:03,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 1841 states and 2278 transitions. [2018-11-10 05:38:03,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2278 transitions. [2018-11-10 05:38:03,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-10 05:38:03,083 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:38:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:38:03,119 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 05:38:03,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:38:03,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 1846 states and 2284 transitions. [2018-11-10 05:38:03,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2284 transitions. [2018-11-10 05:38:03,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-10 05:38:03,375 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:38:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:38:03,405 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-10 05:38:03,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:38:03,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 1852 states and 2292 transitions. [2018-11-10 05:38:03,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2292 transitions. [2018-11-10 05:38:03,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-10 05:38:03,578 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:38:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:38:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:38:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:38:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:38:03,780 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 116 iterations. [2018-11-10 05:38:03,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 05:38:03 ImpRootNode [2018-11-10 05:38:03,890 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 05:38:03,890 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:38:03,890 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:38:03,890 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:38:03,891 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:36:35" (3/4) ... [2018-11-10 05:38:03,892 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 05:38:03,994 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8d9a51f7-c4a8-4680-8a63-71f24e21f3f4/bin-2019/ukojak/witness.graphml [2018-11-10 05:38:03,994 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:38:03,995 INFO L168 Benchmark]: Toolchain (without parser) took 91105.90 ms. Allocated memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: 2.2 GB). Free memory was 952.1 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-10 05:38:03,996 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:38:03,996 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.13 ms. Allocated memory is still 1.0 GB. Free memory was 952.1 MB in the beginning and 917.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 05:38:03,996 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 917.2 MB in the beginning and 1.1 GB in the end (delta: -206.5 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2018-11-10 05:38:03,997 INFO L168 Benchmark]: Boogie Preprocessor took 41.81 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: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. [2018-11-10 05:38:03,997 INFO L168 Benchmark]: RCFGBuilder took 1629.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 879.0 MB in the end (delta: 234.5 MB). Peak memory consumption was 234.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:38:03,997 INFO L168 Benchmark]: CodeCheck took 88856.11 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.1 GB). Free memory was 879.0 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 934.6 MB. Max. memory is 11.5 GB. [2018-11-10 05:38:03,997 INFO L168 Benchmark]: Witness Printer took 104.41 ms. Allocated memory is still 3.2 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:38:03,999 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, 88.7s OverallTime, 116 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 478218444 SDtfs, 1084025658 SDslu, 566195168 SDs, 0 SdLazy, -771598348 SolverSat, -1119696922 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 294.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110513 GetRequests, 106287 SyntacticMatches, 3076 SemanticMatches, 1150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 898403 ImplicationChecksByTransitivity, 76.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 16650 NumberOfCodeBlocks, 16650 NumberOfCodeBlocksAsserted, 116 NumberOfCheckSat, 16331 ConstructedInterpolants, 0 QuantifiedInterpolants, 11501053 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 115 InterpolantComputations, 88 PerfectInterpolantSequences, 11692/12097 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: 413]: 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 TRUE ((((((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)) [L85] a7 = 0 [L86] a20 = 1 [L87] a8 = 14 [L88] a16 = 4 [L89] a21 = 1 [L90] a17 = 0 [L91] RET return -1; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L412] COND TRUE ((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L413] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 368.13 ms. Allocated memory is still 1.0 GB. Free memory was 952.1 MB in the beginning and 917.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 102.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 917.2 MB in the beginning and 1.1 GB in the end (delta: -206.5 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.81 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: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1629.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 879.0 MB in the end (delta: 234.5 MB). Peak memory consumption was 234.5 MB. Max. memory is 11.5 GB. * CodeCheck took 88856.11 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.1 GB). Free memory was 879.0 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 934.6 MB. Max. memory is 11.5 GB. * Witness Printer took 104.41 ms. Allocated memory is still 3.2 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...