./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label59_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6b30ca69-9861-43c4-a19b-bea7497fb95c/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6b30ca69-9861-43c4-a19b-bea7497fb95c/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6b30ca69-9861-43c4-a19b-bea7497fb95c/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6b30ca69-9861-43c4-a19b-bea7497fb95c/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label59_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_6b30ca69-9861-43c4-a19b-bea7497fb95c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6b30ca69-9861-43c4-a19b-bea7497fb95c/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 22ec766384c93b05d1b8a0b6b07fbbb9335a4030 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-635dfa2 [2018-12-08 22:29:15,253 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 22:29:15,254 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 22:29:15,260 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 22:29:15,260 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 22:29:15,260 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 22:29:15,261 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 22:29:15,262 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 22:29:15,264 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 22:29:15,264 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 22:29:15,265 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 22:29:15,265 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 22:29:15,266 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 22:29:15,267 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 22:29:15,267 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 22:29:15,267 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 22:29:15,268 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 22:29:15,269 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 22:29:15,270 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 22:29:15,271 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 22:29:15,271 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 22:29:15,272 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 22:29:15,273 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 22:29:15,273 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 22:29:15,273 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 22:29:15,273 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 22:29:15,274 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 22:29:15,274 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 22:29:15,275 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 22:29:15,275 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 22:29:15,275 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 22:29:15,275 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 22:29:15,276 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 22:29:15,276 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 22:29:15,276 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 22:29:15,276 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 22:29:15,277 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6b30ca69-9861-43c4-a19b-bea7497fb95c/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-08 22:29:15,284 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 22:29:15,284 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 22:29:15,284 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 22:29:15,284 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-08 22:29:15,285 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 22:29:15,285 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 22:29:15,285 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 22:29:15,285 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 22:29:15,285 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 22:29:15,285 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 22:29:15,286 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 22:29:15,286 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 22:29:15,286 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 22:29:15,286 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 22:29:15,286 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 22:29:15,286 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 22:29:15,287 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 22:29:15,287 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 22:29:15,287 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-08 22:29:15,287 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-08 22:29:15,287 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 22:29:15,287 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 22:29:15,287 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-08 22:29:15,288 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 22:29:15,288 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 22:29:15,288 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 22:29:15,288 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-08 22:29:15,288 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 22:29:15,288 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 22:29:15,288 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_6b30ca69-9861-43c4-a19b-bea7497fb95c/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 -> 22ec766384c93b05d1b8a0b6b07fbbb9335a4030 [2018-12-08 22:29:15,310 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 22:29:15,317 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 22:29:15,319 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 22:29:15,320 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 22:29:15,320 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 22:29:15,321 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6b30ca69-9861-43c4-a19b-bea7497fb95c/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem02_label59_false-unreach-call_false-termination.c [2018-12-08 22:29:15,354 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6b30ca69-9861-43c4-a19b-bea7497fb95c/bin-2019/ukojak/data/2861c964d/8b5aa09067644b848771d1aacc818def/FLAG6ff65d5d6 [2018-12-08 22:29:15,669 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 22:29:15,670 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6b30ca69-9861-43c4-a19b-bea7497fb95c/sv-benchmarks/c/eca-rers2012/Problem02_label59_false-unreach-call_false-termination.c [2018-12-08 22:29:15,676 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6b30ca69-9861-43c4-a19b-bea7497fb95c/bin-2019/ukojak/data/2861c964d/8b5aa09067644b848771d1aacc818def/FLAG6ff65d5d6 [2018-12-08 22:29:15,685 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6b30ca69-9861-43c4-a19b-bea7497fb95c/bin-2019/ukojak/data/2861c964d/8b5aa09067644b848771d1aacc818def [2018-12-08 22:29:15,687 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 22:29:15,688 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 22:29:15,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 22:29:15,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 22:29:15,690 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 22:29:15,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:29:15" (1/1) ... [2018-12-08 22:29:15,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f79c046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:29:15, skipping insertion in model container [2018-12-08 22:29:15,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:29:15" (1/1) ... [2018-12-08 22:29:15,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 22:29:15,719 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 22:29:15,886 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 22:29:15,889 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 22:29:15,981 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 22:29:15,991 INFO L195 MainTranslator]: Completed translation [2018-12-08 22:29:15,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:29:15 WrapperNode [2018-12-08 22:29:15,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 22:29:15,992 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 22:29:15,992 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 22:29:15,992 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 22:29:15,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:29:15" (1/1) ... [2018-12-08 22:29:16,008 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:29:15" (1/1) ... [2018-12-08 22:29:16,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 22:29:16,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 22:29:16,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 22:29:16,043 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 22:29:16,050 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:29:15" (1/1) ... [2018-12-08 22:29:16,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:29:15" (1/1) ... [2018-12-08 22:29:16,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:29:15" (1/1) ... [2018-12-08 22:29:16,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:29:15" (1/1) ... [2018-12-08 22:29:16,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:29:15" (1/1) ... [2018-12-08 22:29:16,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:29:15" (1/1) ... [2018-12-08 22:29:16,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:29:15" (1/1) ... [2018-12-08 22:29:16,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 22:29:16,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 22:29:16,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 22:29:16,085 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 22:29:16,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:29:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6b30ca69-9861-43c4-a19b-bea7497fb95c/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-12-08 22:29:16,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 22:29:16,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 22:29:17,137 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 22:29:17,138 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-08 22:29:17,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:29:17 BoogieIcfgContainer [2018-12-08 22:29:17,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 22:29:17,138 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-08 22:29:17,139 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-08 22:29:17,146 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-08 22:29:17,146 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:29:17" (1/1) ... [2018-12-08 22:29:17,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:29:17,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:17,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2018-12-08 22:29:17,179 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2018-12-08 22:29:17,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 22:29:17,182 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:17,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:29:17,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:17,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 163 states and 276 transitions. [2018-12-08 22:29:17,733 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 276 transitions. [2018-12-08 22:29:17,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-08 22:29:17,736 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:17,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:29:18,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:18,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 242 states and 359 transitions. [2018-12-08 22:29:18,186 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 359 transitions. [2018-12-08 22:29:18,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-08 22:29:18,187 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:18,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:29:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:18,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 246 states and 365 transitions. [2018-12-08 22:29:18,344 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 365 transitions. [2018-12-08 22:29:18,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-08 22:29:18,345 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:18,415 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:29:18,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:18,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 325 states and 452 transitions. [2018-12-08 22:29:18,769 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 452 transitions. [2018-12-08 22:29:18,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 22:29:18,773 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:18,819 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:29:19,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:19,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 347 states and 482 transitions. [2018-12-08 22:29:19,104 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 482 transitions. [2018-12-08 22:29:19,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-08 22:29:19,105 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:19,130 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:29:19,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:19,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 366 states and 501 transitions. [2018-12-08 22:29:19,217 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 501 transitions. [2018-12-08 22:29:19,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 22:29:19,218 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:19,312 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:29:19,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 371 states and 509 transitions. [2018-12-08 22:29:19,438 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 509 transitions. [2018-12-08 22:29:19,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-08 22:29:19,439 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:19,455 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:29:19,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:19,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 395 states and 534 transitions. [2018-12-08 22:29:19,577 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 534 transitions. [2018-12-08 22:29:19,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-08 22:29:19,578 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:19,594 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:29:19,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:19,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 398 states and 537 transitions. [2018-12-08 22:29:19,657 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 537 transitions. [2018-12-08 22:29:19,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-08 22:29:19,658 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:19,675 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 22:29:19,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 402 states and 542 transitions. [2018-12-08 22:29:19,823 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 542 transitions. [2018-12-08 22:29:19,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-08 22:29:19,824 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:19,920 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:29:20,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:20,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 434 states and 582 transitions. [2018-12-08 22:29:20,315 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 582 transitions. [2018-12-08 22:29:20,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-08 22:29:20,316 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:20,377 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 22:29:20,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:20,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 462 states and 615 transitions. [2018-12-08 22:29:20,746 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 615 transitions. [2018-12-08 22:29:20,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-08 22:29:20,746 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:20,789 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 22:29:20,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:20,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 465 states and 618 transitions. [2018-12-08 22:29:20,863 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 618 transitions. [2018-12-08 22:29:20,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-08 22:29:20,864 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:20,917 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 22:29:21,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:21,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 494 states and 648 transitions. [2018-12-08 22:29:21,115 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 648 transitions. [2018-12-08 22:29:21,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-08 22:29:21,116 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:21,136 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:29:21,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:21,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 508 states and 662 transitions. [2018-12-08 22:29:21,190 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 662 transitions. [2018-12-08 22:29:21,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-08 22:29:21,191 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:21,220 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:29:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 544 states and 707 transitions. [2018-12-08 22:29:21,746 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 707 transitions. [2018-12-08 22:29:21,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-08 22:29:21,746 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:21,782 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 22:29:21,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:21,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 548 states and 712 transitions. [2018-12-08 22:29:21,971 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 712 transitions. [2018-12-08 22:29:21,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-08 22:29:21,972 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:22,167 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:29:23,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:23,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 588 states and 762 transitions. [2018-12-08 22:29:23,190 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 762 transitions. [2018-12-08 22:29:23,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-08 22:29:23,191 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:23,293 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-08 22:29:23,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:23,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 598 states and 779 transitions. [2018-12-08 22:29:23,750 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 779 transitions. [2018-12-08 22:29:23,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-08 22:29:23,750 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:23,767 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:29:23,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:23,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 618 states and 801 transitions. [2018-12-08 22:29:23,976 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 801 transitions. [2018-12-08 22:29:23,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-08 22:29:23,977 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:29:24,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:24,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 619 states and 802 transitions. [2018-12-08 22:29:24,003 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 802 transitions. [2018-12-08 22:29:24,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-08 22:29:24,004 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:24,021 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 22:29:24,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:24,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 628 states and 811 transitions. [2018-12-08 22:29:24,218 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 811 transitions. [2018-12-08 22:29:24,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-08 22:29:24,218 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:24,280 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-08 22:29:24,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:24,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 631 states and 816 transitions. [2018-12-08 22:29:24,453 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 816 transitions. [2018-12-08 22:29:24,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-08 22:29:24,453 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:24,488 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:29:24,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:24,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 652 states and 838 transitions. [2018-12-08 22:29:24,606 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 838 transitions. [2018-12-08 22:29:24,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-08 22:29:24,607 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:24,624 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-08 22:29:24,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:24,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 657 states and 844 transitions. [2018-12-08 22:29:24,739 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 844 transitions. [2018-12-08 22:29:24,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-08 22:29:24,739 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:24,769 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:29:24,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:24,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 678 states and 868 transitions. [2018-12-08 22:29:24,973 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 868 transitions. [2018-12-08 22:29:24,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-08 22:29:24,973 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:25,027 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:29:25,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 726 states and 919 transitions. [2018-12-08 22:29:25,641 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 919 transitions. [2018-12-08 22:29:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-08 22:29:25,642 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:29:25,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:25,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 729 states and 922 transitions. [2018-12-08 22:29:25,821 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 922 transitions. [2018-12-08 22:29:25,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-08 22:29:25,821 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:29:26,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:26,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 795 states and 996 transitions. [2018-12-08 22:29:26,960 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 996 transitions. [2018-12-08 22:29:26,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-08 22:29:26,961 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:26,982 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-08 22:29:27,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:27,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 800 states and 1002 transitions. [2018-12-08 22:29:27,152 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1002 transitions. [2018-12-08 22:29:27,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-08 22:29:27,153 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:27,175 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:29:27,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:27,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 849 states and 1055 transitions. [2018-12-08 22:29:27,864 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1055 transitions. [2018-12-08 22:29:27,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-08 22:29:27,864 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:27,906 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:29:28,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:28,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 852 states and 1058 transitions. [2018-12-08 22:29:28,028 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1058 transitions. [2018-12-08 22:29:28,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-08 22:29:28,029 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:28,108 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-08 22:29:28,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:28,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 853 states and 1062 transitions. [2018-12-08 22:29:28,299 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1062 transitions. [2018-12-08 22:29:28,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-08 22:29:28,300 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:28,329 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-08 22:29:28,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:28,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 871 states and 1084 transitions. [2018-12-08 22:29:28,732 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1084 transitions. [2018-12-08 22:29:28,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-08 22:29:28,732 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:28,836 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:29:29,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 890 states and 1109 transitions. [2018-12-08 22:29:29,491 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1109 transitions. [2018-12-08 22:29:29,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-08 22:29:29,491 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:29,544 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:29:30,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:30,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 920 states and 1142 transitions. [2018-12-08 22:29:30,124 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1142 transitions. [2018-12-08 22:29:30,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-08 22:29:30,125 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:29:30,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:30,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 924 states and 1146 transitions. [2018-12-08 22:29:30,341 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1146 transitions. [2018-12-08 22:29:30,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-08 22:29:30,342 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:30,390 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:29:30,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 929 states and 1151 transitions. [2018-12-08 22:29:30,554 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1151 transitions. [2018-12-08 22:29:30,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-08 22:29:30,554 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:30,575 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:29:30,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 950 states and 1178 transitions. [2018-12-08 22:29:30,992 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1178 transitions. [2018-12-08 22:29:30,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-08 22:29:30,992 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:31,012 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:29:31,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:31,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 955 states and 1182 transitions. [2018-12-08 22:29:31,200 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1182 transitions. [2018-12-08 22:29:31,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-08 22:29:31,201 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:29:31,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:31,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 959 states and 1186 transitions. [2018-12-08 22:29:31,404 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1186 transitions. [2018-12-08 22:29:31,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-08 22:29:31,405 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:29:31,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:31,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 964 states and 1190 transitions. [2018-12-08 22:29:31,604 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1190 transitions. [2018-12-08 22:29:31,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-08 22:29:31,605 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:31,636 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-08 22:29:31,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:31,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 968 states and 1193 transitions. [2018-12-08 22:29:31,731 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1193 transitions. [2018-12-08 22:29:31,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-08 22:29:31,732 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:31,772 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 22:29:31,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:31,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 969 states and 1197 transitions. [2018-12-08 22:29:31,817 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1197 transitions. [2018-12-08 22:29:31,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-08 22:29:31,818 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:31,839 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 22:29:32,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 989 states and 1217 transitions. [2018-12-08 22:29:32,113 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1217 transitions. [2018-12-08 22:29:32,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-08 22:29:32,114 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:32,135 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 22:29:32,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:32,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 998 states and 1225 transitions. [2018-12-08 22:29:32,305 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1225 transitions. [2018-12-08 22:29:32,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-08 22:29:32,306 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:32,347 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:29:32,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:32,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1015 states and 1243 transitions. [2018-12-08 22:29:32,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1243 transitions. [2018-12-08 22:29:32,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-08 22:29:32,718 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:33,195 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 22:29:35,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1086 states and 1313 transitions. [2018-12-08 22:29:35,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1313 transitions. [2018-12-08 22:29:35,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-08 22:29:35,146 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:35,317 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-08 22:29:36,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:36,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1113 states and 1342 transitions. [2018-12-08 22:29:36,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1342 transitions. [2018-12-08 22:29:36,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-08 22:29:36,081 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 22:29:36,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:36,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1114 states and 1343 transitions. [2018-12-08 22:29:36,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1343 transitions. [2018-12-08 22:29:36,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-08 22:29:36,226 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:36,248 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 22:29:36,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:36,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1117 states and 1346 transitions. [2018-12-08 22:29:36,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1346 transitions. [2018-12-08 22:29:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-08 22:29:36,361 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:36,401 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:29:36,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:36,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1135 states and 1365 transitions. [2018-12-08 22:29:36,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1365 transitions. [2018-12-08 22:29:36,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-08 22:29:36,790 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:36,837 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:29:36,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:36,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1139 states and 1368 transitions. [2018-12-08 22:29:36,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1368 transitions. [2018-12-08 22:29:36,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-08 22:29:36,966 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:37,009 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-08 22:29:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:37,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1158 states and 1389 transitions. [2018-12-08 22:29:37,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1389 transitions. [2018-12-08 22:29:37,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-08 22:29:37,647 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:37,696 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-08 22:29:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:37,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1159 states and 1390 transitions. [2018-12-08 22:29:37,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1390 transitions. [2018-12-08 22:29:37,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-08 22:29:37,720 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:37,775 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-08 22:29:38,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1179 states and 1413 transitions. [2018-12-08 22:29:38,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1413 transitions. [2018-12-08 22:29:38,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-08 22:29:38,402 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:38,761 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 164 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-08 22:29:40,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:40,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1449 states to 1209 states and 1449 transitions. [2018-12-08 22:29:40,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1449 transitions. [2018-12-08 22:29:40,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-08 22:29:40,335 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:40,358 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-08 22:29:40,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:40,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1234 states and 1476 transitions. [2018-12-08 22:29:40,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1476 transitions. [2018-12-08 22:29:40,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-08 22:29:40,897 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:40,939 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:29:41,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:41,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1247 states and 1495 transitions. [2018-12-08 22:29:41,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1495 transitions. [2018-12-08 22:29:41,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-08 22:29:41,556 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:41,602 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:29:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:41,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1250 states and 1499 transitions. [2018-12-08 22:29:41,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1499 transitions. [2018-12-08 22:29:41,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-08 22:29:41,791 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:41,838 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:29:42,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:42,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1253 states and 1502 transitions. [2018-12-08 22:29:42,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1502 transitions. [2018-12-08 22:29:42,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-08 22:29:42,056 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-08 22:29:42,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1278 states and 1527 transitions. [2018-12-08 22:29:42,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1527 transitions. [2018-12-08 22:29:42,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-08 22:29:42,676 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:42,701 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-08 22:29:43,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:43,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1290 states and 1538 transitions. [2018-12-08 22:29:43,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1538 transitions. [2018-12-08 22:29:43,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-08 22:29:43,047 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:43,086 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-08 22:29:43,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:43,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1336 states and 1586 transitions. [2018-12-08 22:29:43,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1586 transitions. [2018-12-08 22:29:43,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-08 22:29:43,501 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:43,547 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-12-08 22:29:43,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:43,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1337 states and 1586 transitions. [2018-12-08 22:29:43,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1586 transitions. [2018-12-08 22:29:43,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-08 22:29:43,575 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:43,613 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-08 22:29:43,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1351 states and 1599 transitions. [2018-12-08 22:29:43,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1599 transitions. [2018-12-08 22:29:43,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-08 22:29:43,658 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-08 22:29:43,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:43,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1357 states and 1606 transitions. [2018-12-08 22:29:43,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1606 transitions. [2018-12-08 22:29:43,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-08 22:29:43,733 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:44,301 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 22:29:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:48,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1456 states and 1708 transitions. [2018-12-08 22:29:48,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1708 transitions. [2018-12-08 22:29:48,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-08 22:29:48,825 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 22:29:50,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:50,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1482 states and 1733 transitions. [2018-12-08 22:29:50,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1733 transitions. [2018-12-08 22:29:50,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-08 22:29:50,181 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:50,329 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-08 22:29:51,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:51,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1510 states and 1765 transitions. [2018-12-08 22:29:51,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 1765 transitions. [2018-12-08 22:29:51,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-08 22:29:51,158 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:51,225 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 144 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-08 22:29:51,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:51,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1529 states and 1784 transitions. [2018-12-08 22:29:51,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 1784 transitions. [2018-12-08 22:29:51,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-08 22:29:51,296 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:51,324 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:29:51,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1544 states and 1800 transitions. [2018-12-08 22:29:51,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1800 transitions. [2018-12-08 22:29:51,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-08 22:29:51,780 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:51,965 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-08 22:29:52,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:52,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1554 states and 1812 transitions. [2018-12-08 22:29:52,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1812 transitions. [2018-12-08 22:29:52,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-08 22:29:52,455 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-08 22:29:52,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:29:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1556 states and 1815 transitions. [2018-12-08 22:29:52,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 1815 transitions. [2018-12-08 22:29:52,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-12-08 22:29:52,715 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:29:52,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:29:53,984 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-08 22:29:57,209 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2018-12-08 22:29:57,900 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2018-12-08 22:29:58,859 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2018-12-08 22:30:06,012 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2018-12-08 22:30:06,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1654 states and 1917 transitions. [2018-12-08 22:30:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 1917 transitions. [2018-12-08 22:30:06,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-12-08 22:30:06,863 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:06,979 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-08 22:30:09,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:09,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1680 states and 1942 transitions. [2018-12-08 22:30:09,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 1942 transitions. [2018-12-08 22:30:09,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-12-08 22:30:09,092 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:09,275 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-08 22:30:10,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:10,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1704 states and 1966 transitions. [2018-12-08 22:30:10,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 1966 transitions. [2018-12-08 22:30:10,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-12-08 22:30:10,071 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:10,119 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-08 22:30:11,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:11,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 1747 states and 2014 transitions. [2018-12-08 22:30:11,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 2014 transitions. [2018-12-08 22:30:11,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-08 22:30:11,302 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:11,344 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-08 22:30:11,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:11,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 1750 states and 2016 transitions. [2018-12-08 22:30:11,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2016 transitions. [2018-12-08 22:30:11,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-08 22:30:11,425 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:11,465 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 143 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-12-08 22:30:12,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:12,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 1781 states and 2052 transitions. [2018-12-08 22:30:12,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2052 transitions. [2018-12-08 22:30:12,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-08 22:30:12,822 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:12,876 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-08 22:30:13,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:13,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 1805 states and 2076 transitions. [2018-12-08 22:30:13,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2076 transitions. [2018-12-08 22:30:13,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-08 22:30:13,271 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:13,305 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-08 22:30:13,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:13,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 1820 states and 2091 transitions. [2018-12-08 22:30:13,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2091 transitions. [2018-12-08 22:30:13,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-12-08 22:30:13,720 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:13,748 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-08 22:30:13,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 1827 states and 2098 transitions. [2018-12-08 22:30:13,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2098 transitions. [2018-12-08 22:30:13,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-12-08 22:30:13,919 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:13,953 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-08 22:30:14,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:14,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 1832 states and 2102 transitions. [2018-12-08 22:30:14,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 2102 transitions. [2018-12-08 22:30:14,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-08 22:30:14,097 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:14,154 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:30:14,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:14,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 1836 states and 2110 transitions. [2018-12-08 22:30:14,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1836 states and 2110 transitions. [2018-12-08 22:30:14,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-08 22:30:14,641 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:15,426 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 22:30:20,210 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-12-08 22:30:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2204 states to 1928 states and 2204 transitions. [2018-12-08 22:30:21,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2204 transitions. [2018-12-08 22:30:21,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-08 22:30:21,747 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:21,841 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 22:30:22,136 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-12-08 22:30:23,028 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-12-08 22:30:23,822 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-12-08 22:30:25,139 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-12-08 22:30:27,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:27,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2229 states to 1954 states and 2229 transitions. [2018-12-08 22:30:27,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2229 transitions. [2018-12-08 22:30:27,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-12-08 22:30:27,057 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:28,094 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 215 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:30:31,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:31,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 2003 states and 2285 transitions. [2018-12-08 22:30:31,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 2285 transitions. [2018-12-08 22:30:31,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-08 22:30:31,498 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:31,540 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-08 22:30:31,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:31,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2009 states and 2290 transitions. [2018-12-08 22:30:31,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 2290 transitions. [2018-12-08 22:30:31,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-08 22:30:31,577 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:31,627 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 136 proven. 5 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-12-08 22:30:32,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:32,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2029 states and 2312 transitions. [2018-12-08 22:30:32,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 2312 transitions. [2018-12-08 22:30:32,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-08 22:30:32,953 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:33,030 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 136 proven. 5 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-12-08 22:30:33,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:33,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2035 states and 2321 transitions. [2018-12-08 22:30:33,537 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 2321 transitions. [2018-12-08 22:30:33,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-08 22:30:33,538 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:33,604 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 136 proven. 5 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-12-08 22:30:33,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:33,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2038 states and 2324 transitions. [2018-12-08 22:30:33,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2038 states and 2324 transitions. [2018-12-08 22:30:33,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-08 22:30:33,900 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:33,958 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 136 proven. 5 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-12-08 22:30:34,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:34,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2068 states and 2355 transitions. [2018-12-08 22:30:34,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2355 transitions. [2018-12-08 22:30:34,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-08 22:30:34,991 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:35,036 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 136 proven. 5 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-12-08 22:30:35,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:35,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2073 states and 2359 transitions. [2018-12-08 22:30:35,074 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 2359 transitions. [2018-12-08 22:30:35,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-12-08 22:30:35,075 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:35,150 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 140 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-12-08 22:30:36,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:36,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2107 states and 2396 transitions. [2018-12-08 22:30:36,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 2396 transitions. [2018-12-08 22:30:36,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-12-08 22:30:36,179 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:36,269 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 22:30:39,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:39,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2454 states to 2165 states and 2454 transitions. [2018-12-08 22:30:39,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 2454 transitions. [2018-12-08 22:30:39,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-12-08 22:30:39,206 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:39,278 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 22:30:39,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:39,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2132 states and 2420 transitions. [2018-12-08 22:30:39,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2420 transitions. [2018-12-08 22:30:39,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-12-08 22:30:39,663 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:39,714 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 145 proven. 3 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-12-08 22:30:39,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:39,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2135 states and 2423 transitions. [2018-12-08 22:30:39,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2135 states and 2423 transitions. [2018-12-08 22:30:39,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-12-08 22:30:39,981 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:40,042 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 145 proven. 3 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-12-08 22:30:40,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:40,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2138 states and 2426 transitions. [2018-12-08 22:30:40,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 2426 transitions. [2018-12-08 22:30:40,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-12-08 22:30:40,247 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 145 proven. 3 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-12-08 22:30:40,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:40,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2143 states and 2431 transitions. [2018-12-08 22:30:40,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2143 states and 2431 transitions. [2018-12-08 22:30:40,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-12-08 22:30:40,785 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 145 proven. 3 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-12-08 22:30:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2439 states to 2152 states and 2439 transitions. [2018-12-08 22:30:40,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2439 transitions. [2018-12-08 22:30:40,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-12-08 22:30:40,889 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:30:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:30:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:30:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:30:41,026 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 102 iterations. [2018-12-08 22:30:41,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.12 10:30:41 ImpRootNode [2018-12-08 22:30:41,127 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-08 22:30:41,127 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 22:30:41,127 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 22:30:41,127 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 22:30:41,128 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:29:17" (3/4) ... [2018-12-08 22:30:41,130 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 22:30:41,230 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6b30ca69-9861-43c4-a19b-bea7497fb95c/bin-2019/ukojak/witness.graphml [2018-12-08 22:30:41,230 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 22:30:41,231 INFO L168 Benchmark]: Toolchain (without parser) took 85543.98 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 715.1 MB). Free memory was 950.6 MB in the beginning and 863.1 MB in the end (delta: 87.6 MB). Peak memory consumption was 802.7 MB. Max. memory is 11.5 GB. [2018-12-08 22:30:41,231 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 22:30:41,231 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -170.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. [2018-12-08 22:30:41,232 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.08 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-12-08 22:30:41,232 INFO L168 Benchmark]: Boogie Preprocessor took 41.78 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-08 22:30:41,232 INFO L168 Benchmark]: RCFGBuilder took 1052.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 878.2 MB in the end (delta: 232.2 MB). Peak memory consumption was 232.2 MB. Max. memory is 11.5 GB. [2018-12-08 22:30:41,232 INFO L168 Benchmark]: CodeCheck took 83988.22 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 573.0 MB). Free memory was 878.2 MB in the beginning and 898.3 MB in the end (delta: -20.1 MB). Peak memory consumption was 552.9 MB. Max. memory is 11.5 GB. [2018-12-08 22:30:41,233 INFO L168 Benchmark]: Witness Printer took 103.26 ms. Allocated memory is still 1.7 GB. Free memory was 898.3 MB in the beginning and 863.1 MB in the end (delta: 35.3 MB). Peak memory consumption was 35.3 MB. Max. memory is 11.5 GB. [2018-12-08 22:30:41,234 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, 227 locations, 1 error locations. UNSAFE Result, 83.8s OverallTime, 102 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1601790936 SDtfs, 417461664 SDslu, 582229192 SDs, 0 SdLazy, -1857170456 SolverSat, -702535712 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 292.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111770 GetRequests, 109360 SyntacticMatches, 1480 SemanticMatches, 930 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666698 ImplicationChecksByTransitivity, 71.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.3s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 17230 NumberOfCodeBlocks, 17230 NumberOfCodeBlocksAsserted, 102 NumberOfCheckSat, 16901 ConstructedInterpolants, 0 QuantifiedInterpolants, 10387625 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 101 InterpolantComputations, 84 PerfectInterpolantSequences, 12538/12645 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: 421]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L235] a28 = 9 [L236] return 23; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L395] a19 = 0 [L396] a28 = 7 [L397] return 25; VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND TRUE ((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8)))) [L155] a25 = 1 [L156] a19 = 1 [L157] a28 = 7 [L158] return -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) [L417] COND FALSE !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L420] COND TRUE ((((((a25==1)&&!(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L421] __VERIFIER_error() VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=7, 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 303.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -170.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.08 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.78 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1052.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 878.2 MB in the end (delta: 232.2 MB). Peak memory consumption was 232.2 MB. Max. memory is 11.5 GB. * CodeCheck took 83988.22 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 573.0 MB). Free memory was 878.2 MB in the beginning and 898.3 MB in the end (delta: -20.1 MB). Peak memory consumption was 552.9 MB. Max. memory is 11.5 GB. * Witness Printer took 103.26 ms. Allocated memory is still 1.7 GB. Free memory was 898.3 MB in the beginning and 863.1 MB in the end (delta: 35.3 MB). Peak memory consumption was 35.3 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...