./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label35_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_8838c216-226d-4844-9bae-6025185c9633/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8838c216-226d-4844-9bae-6025185c9633/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8838c216-226d-4844-9bae-6025185c9633/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8838c216-226d-4844-9bae-6025185c9633/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label35_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8838c216-226d-4844-9bae-6025185c9633/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8838c216-226d-4844-9bae-6025185c9633/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 e1627e38bed35af1698e9f3e6e9827d6a9566f03 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:30:42,785 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 22:30:42,786 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 22:30:42,792 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 22:30:42,792 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 22:30:42,792 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 22:30:42,793 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 22:30:42,794 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 22:30:42,794 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 22:30:42,795 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 22:30:42,795 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 22:30:42,795 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 22:30:42,796 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 22:30:42,796 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 22:30:42,797 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 22:30:42,797 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 22:30:42,798 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 22:30:42,799 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 22:30:42,800 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 22:30:42,800 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 22:30:42,801 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 22:30:42,801 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 22:30:42,803 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 22:30:42,803 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 22:30:42,803 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 22:30:42,803 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 22:30:42,804 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 22:30:42,804 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 22:30:42,804 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 22:30:42,805 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 22:30:42,805 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 22:30:42,805 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 22:30:42,806 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 22:30:42,806 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 22:30:42,806 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 22:30:42,806 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 22:30:42,807 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8838c216-226d-4844-9bae-6025185c9633/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-08 22:30:42,814 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 22:30:42,814 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 22:30:42,814 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 22:30:42,815 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-08 22:30:42,815 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 22:30:42,815 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 22:30:42,815 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 22:30:42,815 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 22:30:42,815 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 22:30:42,815 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 22:30:42,815 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 22:30:42,815 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 22:30:42,816 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 22:30:42,816 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 22:30:42,816 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 22:30:42,816 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 22:30:42,816 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 22:30:42,816 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 22:30:42,816 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-08 22:30:42,816 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-08 22:30:42,816 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 22:30:42,816 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 22:30:42,816 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-08 22:30:42,816 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 22:30:42,817 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 22:30:42,817 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 22:30:42,817 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-08 22:30:42,817 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 22:30:42,817 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 22:30:42,817 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_8838c216-226d-4844-9bae-6025185c9633/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 -> e1627e38bed35af1698e9f3e6e9827d6a9566f03 [2018-12-08 22:30:42,835 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 22:30:42,843 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 22:30:42,846 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 22:30:42,847 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 22:30:42,847 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 22:30:42,847 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8838c216-226d-4844-9bae-6025185c9633/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label35_false-unreach-call_false-termination.c [2018-12-08 22:30:42,884 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8838c216-226d-4844-9bae-6025185c9633/bin-2019/ukojak/data/80d4c4858/99b2d54abda24a23af5b9c47a2553392/FLAGde53fbc86 [2018-12-08 22:30:43,299 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 22:30:43,299 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8838c216-226d-4844-9bae-6025185c9633/sv-benchmarks/c/eca-rers2012/Problem01_label35_false-unreach-call_false-termination.c [2018-12-08 22:30:43,306 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8838c216-226d-4844-9bae-6025185c9633/bin-2019/ukojak/data/80d4c4858/99b2d54abda24a23af5b9c47a2553392/FLAGde53fbc86 [2018-12-08 22:30:43,315 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8838c216-226d-4844-9bae-6025185c9633/bin-2019/ukojak/data/80d4c4858/99b2d54abda24a23af5b9c47a2553392 [2018-12-08 22:30:43,317 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 22:30:43,317 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 22:30:43,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 22:30:43,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 22:30:43,320 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 22:30:43,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:30:43" (1/1) ... [2018-12-08 22:30:43,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba821c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:30:43, skipping insertion in model container [2018-12-08 22:30:43,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:30:43" (1/1) ... [2018-12-08 22:30:43,326 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 22:30:43,350 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 22:30:43,527 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 22:30:43,530 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 22:30:43,575 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 22:30:43,647 INFO L195 MainTranslator]: Completed translation [2018-12-08 22:30:43,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:30:43 WrapperNode [2018-12-08 22:30:43,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 22:30:43,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 22:30:43,648 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 22:30:43,648 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 22:30:43,654 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:30:43" (1/1) ... [2018-12-08 22:30:43,665 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:30:43" (1/1) ... [2018-12-08 22:30:43,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 22:30:43,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 22:30:43,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 22:30:43,701 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 22:30:43,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:30:43" (1/1) ... [2018-12-08 22:30:43,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:30:43" (1/1) ... [2018-12-08 22:30:43,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:30:43" (1/1) ... [2018-12-08 22:30:43,712 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:30:43" (1/1) ... [2018-12-08 22:30:43,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:30:43" (1/1) ... [2018-12-08 22:30:43,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:30:43" (1/1) ... [2018-12-08 22:30:43,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:30:43" (1/1) ... [2018-12-08 22:30:43,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 22:30:43,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 22:30:43,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 22:30:43,742 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 22:30:43,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:30:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8838c216-226d-4844-9bae-6025185c9633/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:30:43,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 22:30:43,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 22:30:44,809 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 22:30:44,809 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-08 22:30:44,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:30:44 BoogieIcfgContainer [2018-12-08 22:30:44,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 22:30:44,810 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-08 22:30:44,811 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-08 22:30:44,820 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-08 22:30:44,820 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:30:44" (1/1) ... [2018-12-08 22:30:44,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:30:44,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:44,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2018-12-08 22:30:44,856 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2018-12-08 22:30:44,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 22:30:44,858 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:45,087 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:30:45,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:45,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 145 states and 239 transitions. [2018-12-08 22:30:45,405 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 239 transitions. [2018-12-08 22:30:45,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-08 22:30:45,407 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:45,508 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:30:45,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:45,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 146 states and 240 transitions. [2018-12-08 22:30:45,662 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 240 transitions. [2018-12-08 22:30:45,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-08 22:30:45,663 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:45,686 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:30:45,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:45,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 150 states and 247 transitions. [2018-12-08 22:30:45,772 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 247 transitions. [2018-12-08 22:30:45,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 22:30:45,773 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:30:45,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:45,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 151 states and 249 transitions. [2018-12-08 22:30:45,828 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 249 transitions. [2018-12-08 22:30:45,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 22:30:45,832 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:45,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:30:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:46,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 221 states and 323 transitions. [2018-12-08 22:30:46,251 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 323 transitions. [2018-12-08 22:30:46,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-08 22:30:46,252 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:30:46,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:46,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 228 states and 337 transitions. [2018-12-08 22:30:46,502 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 337 transitions. [2018-12-08 22:30:46,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 22:30:46,503 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:46,515 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 22:30:46,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:46,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 229 states and 338 transitions. [2018-12-08 22:30:46,550 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 338 transitions. [2018-12-08 22:30:46,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 22:30:46,551 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:46,563 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:30:46,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:46,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 233 states and 344 transitions. [2018-12-08 22:30:46,721 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 344 transitions. [2018-12-08 22:30:46,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 22:30:46,721 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:46,791 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:30:47,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 241 states and 360 transitions. [2018-12-08 22:30:47,198 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 360 transitions. [2018-12-08 22:30:47,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-08 22:30:47,199 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:47,240 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 22:30:47,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:47,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 246 states and 369 transitions. [2018-12-08 22:30:47,356 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 369 transitions. [2018-12-08 22:30:47,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-08 22:30:47,357 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:47,379 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:30:47,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:47,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 250 states and 376 transitions. [2018-12-08 22:30:47,583 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2018-12-08 22:30:47,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-08 22:30:47,584 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:30:47,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:47,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 255 states and 383 transitions. [2018-12-08 22:30:47,670 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 383 transitions. [2018-12-08 22:30:47,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-08 22:30:47,671 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:47,692 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:30:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 261 states and 392 transitions. [2018-12-08 22:30:47,892 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 392 transitions. [2018-12-08 22:30:47,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-08 22:30:47,893 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:47,914 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:30:48,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:48,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 264 states and 395 transitions. [2018-12-08 22:30:48,014 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 395 transitions. [2018-12-08 22:30:48,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-08 22:30:48,015 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:48,100 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:30:48,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:48,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 278 states and 418 transitions. [2018-12-08 22:30:48,692 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 418 transitions. [2018-12-08 22:30:48,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-08 22:30:48,693 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:48,704 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:30:48,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:48,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 282 states and 427 transitions. [2018-12-08 22:30:48,950 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 427 transitions. [2018-12-08 22:30:48,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-08 22:30:48,950 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:48,962 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:30:49,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:49,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 283 states and 427 transitions. [2018-12-08 22:30:49,050 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 427 transitions. [2018-12-08 22:30:49,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-08 22:30:49,051 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:49,063 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 22:30:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:49,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 285 states and 428 transitions. [2018-12-08 22:30:49,171 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 428 transitions. [2018-12-08 22:30:49,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-08 22:30:49,172 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:49,221 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:30:49,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:49,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 291 states and 435 transitions. [2018-12-08 22:30:49,520 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 435 transitions. [2018-12-08 22:30:49,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-08 22:30:49,521 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:49,530 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 22:30:49,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:49,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 292 states and 437 transitions. [2018-12-08 22:30:49,680 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 437 transitions. [2018-12-08 22:30:49,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-08 22:30:49,681 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:49,693 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:30:49,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:49,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 297 states and 442 transitions. [2018-12-08 22:30:49,721 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 442 transitions. [2018-12-08 22:30:49,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-08 22:30:49,722 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:49,734 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:30:49,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:49,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 298 states and 442 transitions. [2018-12-08 22:30:49,798 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 442 transitions. [2018-12-08 22:30:49,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 22:30:49,798 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:49,809 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:30:50,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:50,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 305 states and 451 transitions. [2018-12-08 22:30:50,116 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 451 transitions. [2018-12-08 22:30:50,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 22:30:50,116 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:50,159 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:30:51,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:51,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 323 states and 480 transitions. [2018-12-08 22:30:51,016 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 480 transitions. [2018-12-08 22:30:51,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 22:30:51,017 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:51,031 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 22:30:51,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:51,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 328 states and 488 transitions. [2018-12-08 22:30:51,256 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 488 transitions. [2018-12-08 22:30:51,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-08 22:30:51,256 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:51,271 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 22:30:51,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:51,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 335 states and 498 transitions. [2018-12-08 22:30:51,423 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 498 transitions. [2018-12-08 22:30:51,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-08 22:30:51,424 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:51,442 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 22:30:51,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:51,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 337 states and 500 transitions. [2018-12-08 22:30:51,673 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 500 transitions. [2018-12-08 22:30:51,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-08 22:30:51,673 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:51,690 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 22:30:51,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:51,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 338 states and 502 transitions. [2018-12-08 22:30:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 502 transitions. [2018-12-08 22:30:51,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-08 22:30:51,788 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:51,806 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:30:51,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:51,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 345 states and 511 transitions. [2018-12-08 22:30:51,963 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 511 transitions. [2018-12-08 22:30:51,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 22:30:51,963 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:51,974 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:30:52,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:52,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 347 states and 513 transitions. [2018-12-08 22:30:52,065 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 513 transitions. [2018-12-08 22:30:52,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 22:30:52,065 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:52,124 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:30:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:53,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 374 states and 551 transitions. [2018-12-08 22:30:53,177 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 551 transitions. [2018-12-08 22:30:53,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 22:30:53,178 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:53,258 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:30:54,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:54,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 396 states and 591 transitions. [2018-12-08 22:30:54,945 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 591 transitions. [2018-12-08 22:30:54,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 22:30:54,947 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:54,984 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:30:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 398 states and 593 transitions. [2018-12-08 22:30:55,009 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 593 transitions. [2018-12-08 22:30:55,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 22:30:55,010 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:55,094 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:30:55,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:55,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 414 states and 612 transitions. [2018-12-08 22:30:55,783 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 612 transitions. [2018-12-08 22:30:55,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 22:30:55,783 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:55,794 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 22:30:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 422 states and 622 transitions. [2018-12-08 22:30:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 622 transitions. [2018-12-08 22:30:56,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 22:30:56,049 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:56,062 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 22:30:56,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:56,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 427 states and 627 transitions. [2018-12-08 22:30:56,082 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 627 transitions. [2018-12-08 22:30:56,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 22:30:56,082 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 22:30:56,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:56,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 429 states and 630 transitions. [2018-12-08 22:30:56,296 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 630 transitions. [2018-12-08 22:30:56,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 22:30:56,296 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:56,310 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:30:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:56,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 432 states and 633 transitions. [2018-12-08 22:30:56,432 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 633 transitions. [2018-12-08 22:30:56,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 22:30:56,432 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:56,446 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:30:57,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:57,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 453 states and 658 transitions. [2018-12-08 22:30:57,065 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 658 transitions. [2018-12-08 22:30:57,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 22:30:57,066 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:57,081 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:30:57,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 464 states and 670 transitions. [2018-12-08 22:30:57,597 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 670 transitions. [2018-12-08 22:30:57,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 22:30:57,597 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:57,873 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:30:59,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 478 states and 691 transitions. [2018-12-08 22:30:59,468 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 691 transitions. [2018-12-08 22:30:59,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 22:30:59,469 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:59,553 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:30:59,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:59,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 484 states and 698 transitions. [2018-12-08 22:30:59,758 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 698 transitions. [2018-12-08 22:30:59,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 22:30:59,758 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:59,771 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:30:59,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:59,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 491 states and 706 transitions. [2018-12-08 22:30:59,949 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 706 transitions. [2018-12-08 22:30:59,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 22:30:59,950 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:30:59,962 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:30:59,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:30:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 498 states and 713 transitions. [2018-12-08 22:30:59,987 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 713 transitions. [2018-12-08 22:30:59,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-08 22:30:59,988 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:30:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:00,001 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:31:00,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:00,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 500 states and 717 transitions. [2018-12-08 22:31:00,090 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 717 transitions. [2018-12-08 22:31:00,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-08 22:31:00,090 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:00,103 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:31:00,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:00,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 502 states and 719 transitions. [2018-12-08 22:31:00,120 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 719 transitions. [2018-12-08 22:31:00,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-08 22:31:00,121 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:00,186 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 22:31:00,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 506 states and 725 transitions. [2018-12-08 22:31:00,593 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 725 transitions. [2018-12-08 22:31:00,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-08 22:31:00,594 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:00,743 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:31:02,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:02,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 537 states and 762 transitions. [2018-12-08 22:31:02,303 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 762 transitions. [2018-12-08 22:31:02,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-08 22:31:02,304 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:02,325 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:31:03,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:03,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 557 states and 790 transitions. [2018-12-08 22:31:03,226 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 790 transitions. [2018-12-08 22:31:03,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-08 22:31:03,227 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:03,260 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:31:03,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:03,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 563 states and 798 transitions. [2018-12-08 22:31:03,753 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 798 transitions. [2018-12-08 22:31:03,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-08 22:31:03,753 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:03,775 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:31:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 576 states and 813 transitions. [2018-12-08 22:31:05,099 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 813 transitions. [2018-12-08 22:31:05,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-08 22:31:05,100 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:05,141 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:31:05,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:05,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 581 states and 819 transitions. [2018-12-08 22:31:05,322 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 819 transitions. [2018-12-08 22:31:05,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 22:31:05,322 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:05,338 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:31:06,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:06,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 601 states and 847 transitions. [2018-12-08 22:31:06,799 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 847 transitions. [2018-12-08 22:31:06,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 22:31:06,800 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:06,819 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:31:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:07,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 608 states and 853 transitions. [2018-12-08 22:31:07,707 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 853 transitions. [2018-12-08 22:31:07,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 22:31:07,707 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:31:08,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 622 states and 869 transitions. [2018-12-08 22:31:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 869 transitions. [2018-12-08 22:31:08,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-08 22:31:08,243 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:08,268 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:31:08,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:08,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 631 states and 882 transitions. [2018-12-08 22:31:08,516 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 882 transitions. [2018-12-08 22:31:08,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-08 22:31:08,516 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:08,580 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:31:09,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 636 states and 891 transitions. [2018-12-08 22:31:09,221 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 891 transitions. [2018-12-08 22:31:09,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-08 22:31:09,222 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:09,248 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:31:10,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:10,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 643 states and 901 transitions. [2018-12-08 22:31:10,159 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 901 transitions. [2018-12-08 22:31:10,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-08 22:31:10,160 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:10,202 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:31:10,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:10,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 644 states and 903 transitions. [2018-12-08 22:31:10,451 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 903 transitions. [2018-12-08 22:31:10,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-08 22:31:10,452 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:10,473 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:31:10,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:10,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 645 states and 905 transitions. [2018-12-08 22:31:10,713 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 905 transitions. [2018-12-08 22:31:10,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-08 22:31:10,713 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:10,737 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:31:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:11,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 651 states and 913 transitions. [2018-12-08 22:31:11,193 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 913 transitions. [2018-12-08 22:31:11,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-08 22:31:11,193 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:11,213 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 22:31:11,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:11,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 660 states and 921 transitions. [2018-12-08 22:31:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 921 transitions. [2018-12-08 22:31:11,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-08 22:31:11,780 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:31:14,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:14,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 685 states and 962 transitions. [2018-12-08 22:31:14,334 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 962 transitions. [2018-12-08 22:31:14,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-08 22:31:14,335 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:14,532 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:31:15,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:15,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 710 states and 988 transitions. [2018-12-08 22:31:15,372 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 988 transitions. [2018-12-08 22:31:15,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-08 22:31:15,373 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:15,504 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:31:16,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:16,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 725 states and 1011 transitions. [2018-12-08 22:31:16,788 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1011 transitions. [2018-12-08 22:31:16,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-08 22:31:16,788 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:16,802 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:31:17,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:17,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 730 states and 1016 transitions. [2018-12-08 22:31:17,069 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1016 transitions. [2018-12-08 22:31:17,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-08 22:31:17,070 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:17,085 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:31:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:17,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 732 states and 1019 transitions. [2018-12-08 22:31:17,526 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1019 transitions. [2018-12-08 22:31:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-08 22:31:17,526 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:17,542 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:31:18,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:18,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 735 states and 1021 transitions. [2018-12-08 22:31:18,290 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1021 transitions. [2018-12-08 22:31:18,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-08 22:31:18,291 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:18,317 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:31:18,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 737 states and 1022 transitions. [2018-12-08 22:31:18,463 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1022 transitions. [2018-12-08 22:31:18,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-08 22:31:18,464 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:18,478 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:31:18,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:18,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 747 states and 1033 transitions. [2018-12-08 22:31:18,509 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1033 transitions. [2018-12-08 22:31:18,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-08 22:31:18,509 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:18,524 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:31:18,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:18,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 748 states and 1034 transitions. [2018-12-08 22:31:18,644 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1034 transitions. [2018-12-08 22:31:18,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-08 22:31:18,645 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:18,670 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:31:19,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:19,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 761 states and 1056 transitions. [2018-12-08 22:31:19,632 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1056 transitions. [2018-12-08 22:31:19,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-08 22:31:19,632 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:19,938 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:31:23,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:23,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 801 states and 1098 transitions. [2018-12-08 22:31:23,253 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1098 transitions. [2018-12-08 22:31:23,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-08 22:31:23,253 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:23,459 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:31:24,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:24,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 811 states and 1120 transitions. [2018-12-08 22:31:24,464 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1120 transitions. [2018-12-08 22:31:24,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-08 22:31:24,464 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:24,482 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:31:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:24,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 812 states and 1120 transitions. [2018-12-08 22:31:24,640 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1120 transitions. [2018-12-08 22:31:24,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-08 22:31:24,641 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:24,657 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:31:24,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:24,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 813 states and 1121 transitions. [2018-12-08 22:31:24,901 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1121 transitions. [2018-12-08 22:31:24,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-08 22:31:24,902 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:24,918 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:31:25,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:25,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 814 states and 1122 transitions. [2018-12-08 22:31:25,197 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1122 transitions. [2018-12-08 22:31:25,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-08 22:31:25,197 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:25,213 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:31:26,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:26,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 826 states and 1137 transitions. [2018-12-08 22:31:26,243 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1137 transitions. [2018-12-08 22:31:26,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-08 22:31:26,244 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:26,260 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:31:26,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:26,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 833 states and 1145 transitions. [2018-12-08 22:31:26,713 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1145 transitions. [2018-12-08 22:31:26,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-08 22:31:26,713 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:26,733 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:31:28,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:28,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 847 states and 1167 transitions. [2018-12-08 22:31:28,860 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1167 transitions. [2018-12-08 22:31:28,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-08 22:31:28,861 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:28,891 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:31:29,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:29,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 850 states and 1171 transitions. [2018-12-08 22:31:29,471 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1171 transitions. [2018-12-08 22:31:29,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-08 22:31:29,472 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:29,492 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:31:29,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:29,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 852 states and 1173 transitions. [2018-12-08 22:31:29,980 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1173 transitions. [2018-12-08 22:31:29,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-08 22:31:29,981 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:30,000 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:31:30,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:30,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 857 states and 1179 transitions. [2018-12-08 22:31:30,306 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1179 transitions. [2018-12-08 22:31:30,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 22:31:30,307 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:30,324 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 22:31:30,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:30,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 859 states and 1182 transitions. [2018-12-08 22:31:30,455 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1182 transitions. [2018-12-08 22:31:30,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 22:31:30,456 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:30,472 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 22:31:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:30,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 860 states and 1183 transitions. [2018-12-08 22:31:30,486 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1183 transitions. [2018-12-08 22:31:30,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 22:31:30,487 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:30,506 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:31:34,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:34,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 898 states and 1230 transitions. [2018-12-08 22:31:34,844 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1230 transitions. [2018-12-08 22:31:34,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 22:31:34,844 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:34,864 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:31:35,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 909 states and 1239 transitions. [2018-12-08 22:31:35,873 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1239 transitions. [2018-12-08 22:31:35,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 22:31:35,874 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:31:36,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:36,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 953 states and 1285 transitions. [2018-12-08 22:31:36,713 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1285 transitions. [2018-12-08 22:31:36,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 22:31:36,714 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:36,733 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:31:37,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:37,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 954 states and 1286 transitions. [2018-12-08 22:31:37,070 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1286 transitions. [2018-12-08 22:31:37,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 22:31:37,070 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:37,086 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 22:31:37,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:37,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 955 states and 1286 transitions. [2018-12-08 22:31:37,231 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1286 transitions. [2018-12-08 22:31:37,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 22:31:37,232 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:37,251 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:31:37,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:37,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 956 states and 1286 transitions. [2018-12-08 22:31:37,430 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1286 transitions. [2018-12-08 22:31:37,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 22:31:37,431 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:31:37,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:37,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 957 states and 1286 transitions. [2018-12-08 22:31:37,529 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1286 transitions. [2018-12-08 22:31:37,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-08 22:31:37,530 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:37,834 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 22:31:42,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:42,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 981 states and 1322 transitions. [2018-12-08 22:31:42,696 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1322 transitions. [2018-12-08 22:31:42,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-08 22:31:42,697 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:42,713 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-08 22:31:43,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:43,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 994 states and 1345 transitions. [2018-12-08 22:31:43,722 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1345 transitions. [2018-12-08 22:31:43,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-08 22:31:43,722 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:43,738 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-08 22:31:44,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:44,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 996 states and 1348 transitions. [2018-12-08 22:31:44,100 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1348 transitions. [2018-12-08 22:31:44,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-08 22:31:44,101 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:44,117 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-08 22:31:44,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:44,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 998 states and 1351 transitions. [2018-12-08 22:31:44,513 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1351 transitions. [2018-12-08 22:31:44,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-08 22:31:44,514 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:44,534 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-08 22:31:44,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:44,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 999 states and 1352 transitions. [2018-12-08 22:31:44,798 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1352 transitions. [2018-12-08 22:31:44,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-08 22:31:44,799 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:44,815 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-08 22:31:45,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:45,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1000 states and 1353 transitions. [2018-12-08 22:31:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1353 transitions. [2018-12-08 22:31:45,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-08 22:31:45,216 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:31:46,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:46,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1070 states and 1427 transitions. [2018-12-08 22:31:46,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1427 transitions. [2018-12-08 22:31:46,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-08 22:31:46,510 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:46,536 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:31:47,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:47,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1086 states and 1446 transitions. [2018-12-08 22:31:47,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1446 transitions. [2018-12-08 22:31:47,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-08 22:31:47,354 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:47,380 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:31:47,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:47,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1096 states and 1455 transitions. [2018-12-08 22:31:47,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1455 transitions. [2018-12-08 22:31:47,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-08 22:31:47,983 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-08 22:31:48,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:48,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1098 states and 1456 transitions. [2018-12-08 22:31:48,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1456 transitions. [2018-12-08 22:31:48,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-08 22:31:48,340 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:48,356 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-08 22:31:48,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1100 states and 1457 transitions. [2018-12-08 22:31:48,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1457 transitions. [2018-12-08 22:31:48,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-08 22:31:48,717 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:48,776 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:31:49,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:49,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1111 states and 1471 transitions. [2018-12-08 22:31:49,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1471 transitions. [2018-12-08 22:31:49,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-08 22:31:49,958 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:50,768 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 95 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:31:56,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:56,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1126 states and 1492 transitions. [2018-12-08 22:31:56,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1492 transitions. [2018-12-08 22:31:56,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-08 22:31:56,319 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:56,387 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:31:56,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:31:56,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1127 states and 1493 transitions. [2018-12-08 22:31:56,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1493 transitions. [2018-12-08 22:31:56,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-08 22:31:56,405 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:31:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:31:57,298 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:32:01,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:32:01,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1194 states and 1565 transitions. [2018-12-08 22:32:01,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1565 transitions. [2018-12-08 22:32:01,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-08 22:32:01,706 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:32:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:32:01,726 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-08 22:32:02,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:32:02,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1207 states and 1584 transitions. [2018-12-08 22:32:02,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1584 transitions. [2018-12-08 22:32:02,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-08 22:32:02,990 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:32:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:32:05,222 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:32:17,114 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2018-12-08 22:32:18,126 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2018-12-08 22:32:19,337 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2018-12-08 22:32:23,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:32:23,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1322 states and 1713 transitions. [2018-12-08 22:32:23,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1713 transitions. [2018-12-08 22:32:23,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-08 22:32:23,457 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:32:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:32:23,552 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 22:32:24,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:32:24,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1344 states and 1738 transitions. [2018-12-08 22:32:24,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1738 transitions. [2018-12-08 22:32:24,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-08 22:32:24,963 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:32:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:32:25,056 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 22:32:25,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:32:25,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1350 states and 1743 transitions. [2018-12-08 22:32:25,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1743 transitions. [2018-12-08 22:32:25,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-08 22:32:25,462 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:32:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:32:25,532 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 22:32:26,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:32:26,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1376 states and 1768 transitions. [2018-12-08 22:32:26,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1768 transitions. [2018-12-08 22:32:26,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 22:32:26,522 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:32:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:32:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-12-08 22:32:31,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:32:31,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1401 states and 1798 transitions. [2018-12-08 22:32:31,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1798 transitions. [2018-12-08 22:32:31,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 22:32:31,392 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:32:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:32:31,412 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 22:32:31,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:32:31,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1412 states and 1810 transitions. [2018-12-08 22:32:31,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 1810 transitions. [2018-12-08 22:32:31,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 22:32:31,452 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:32:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:32:31,473 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 22:32:32,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:32:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1426 states and 1829 transitions. [2018-12-08 22:32:32,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1829 transitions. [2018-12-08 22:32:32,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 22:32:32,571 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:32:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:32:32,591 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 22:32:32,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:32:32,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1431 states and 1834 transitions. [2018-12-08 22:32:32,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1834 transitions. [2018-12-08 22:32:32,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 22:32:32,988 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:32:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:32:33,017 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 22:32:34,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:32:34,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1438 states and 1842 transitions. [2018-12-08 22:32:34,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1842 transitions. [2018-12-08 22:32:34,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 22:32:34,393 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:32:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:32:35,170 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 89 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:32:40,874 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-12-08 22:32:43,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:32:43,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1467 states and 1886 transitions. [2018-12-08 22:32:43,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1886 transitions. [2018-12-08 22:32:43,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 22:32:43,493 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:32:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:32:43,538 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 89 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:32:45,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:32:45,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1483 states and 1902 transitions. [2018-12-08 22:32:45,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1902 transitions. [2018-12-08 22:32:45,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 22:32:45,533 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:32:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:32:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 89 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:32:46,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:32:46,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1484 states and 1906 transitions. [2018-12-08 22:32:46,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1906 transitions. [2018-12-08 22:32:46,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 22:32:46,084 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:32:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:32:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 89 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:32:46,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:32:46,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1486 states and 1907 transitions. [2018-12-08 22:32:46,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1907 transitions. [2018-12-08 22:32:46,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 22:32:46,651 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:32:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:32:46,701 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 89 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:32:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:32:49,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1494 states and 1914 transitions. [2018-12-08 22:32:49,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1914 transitions. [2018-12-08 22:32:49,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-08 22:32:49,541 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:32:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:32:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 22:32:49,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:32:49,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1495 states and 1915 transitions. [2018-12-08 22:32:49,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1915 transitions. [2018-12-08 22:32:49,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-08 22:32:49,584 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:32:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:32:49,605 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 22:32:49,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:32:49,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1496 states and 1917 transitions. [2018-12-08 22:32:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 1917 transitions. [2018-12-08 22:32:49,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-08 22:32:49,629 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:32:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:32:49,714 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-08 22:32:50,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:32:50,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1500 states and 1922 transitions. [2018-12-08 22:32:50,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1922 transitions. [2018-12-08 22:32:50,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-08 22:32:50,769 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:32:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:32:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:32:53,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:32:53,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1517 states and 1944 transitions. [2018-12-08 22:32:53,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1944 transitions. [2018-12-08 22:32:53,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-08 22:32:53,490 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:32:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:32:53,811 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:32:55,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:32:55,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1523 states and 1951 transitions. [2018-12-08 22:32:55,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1951 transitions. [2018-12-08 22:32:55,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-08 22:32:55,469 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:32:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:32:55,522 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:32:56,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:32:56,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 1588 states and 2015 transitions. [2018-12-08 22:32:56,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 2015 transitions. [2018-12-08 22:32:56,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-08 22:32:56,487 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:32:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:32:56,510 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:32:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:32:58,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 1597 states and 2030 transitions. [2018-12-08 22:32:58,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2030 transitions. [2018-12-08 22:32:58,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-08 22:32:58,582 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:32:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:32:58,606 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-08 22:32:59,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:32:59,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 1603 states and 2039 transitions. [2018-12-08 22:32:59,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2039 transitions. [2018-12-08 22:32:59,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-08 22:32:59,787 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:32:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:32:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 22:33:00,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:33:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 1608 states and 2045 transitions. [2018-12-08 22:33:00,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2045 transitions. [2018-12-08 22:33:00,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-08 22:33:00,683 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:33:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:33:00,713 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:33:02,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:33:02,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 1625 states and 2066 transitions. [2018-12-08 22:33:02,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 2066 transitions. [2018-12-08 22:33:02,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-08 22:33:02,615 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:33:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:33:02,656 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:33:04,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:33:04,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 1630 states and 2071 transitions. [2018-12-08 22:33:04,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2071 transitions. [2018-12-08 22:33:04,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-08 22:33:04,221 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:33:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:33:04,243 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-08 22:33:06,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:33:06,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 1639 states and 2082 transitions. [2018-12-08 22:33:06,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2082 transitions. [2018-12-08 22:33:06,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-08 22:33:06,243 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:33:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:33:06,518 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-08 22:33:07,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:33:07,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 1644 states and 2089 transitions. [2018-12-08 22:33:07,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2089 transitions. [2018-12-08 22:33:07,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-08 22:33:07,334 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:33:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:33:07,357 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:33:14,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:33:14,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 1659 states and 2111 transitions. [2018-12-08 22:33:14,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2111 transitions. [2018-12-08 22:33:14,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-08 22:33:14,252 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:33:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:33:14,283 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:33:16,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:33:16,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 1665 states and 2120 transitions. [2018-12-08 22:33:16,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2120 transitions. [2018-12-08 22:33:16,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-08 22:33:16,404 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:33:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:33:17,799 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 98 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:33:26,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:33:26,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 1677 states and 2133 transitions. [2018-12-08 22:33:26,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2133 transitions. [2018-12-08 22:33:26,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-08 22:33:26,208 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:33:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:33:26,285 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:33:36,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:33:36,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 1693 states and 2157 transitions. [2018-12-08 22:33:36,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2157 transitions. [2018-12-08 22:33:36,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-08 22:33:36,719 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:33:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:33:36,755 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:33:40,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:33:40,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 1703 states and 2173 transitions. [2018-12-08 22:33:40,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2173 transitions. [2018-12-08 22:33:40,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-08 22:33:40,350 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:33:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:33:40,384 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-08 22:33:45,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:33:45,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2212 states to 1728 states and 2212 transitions. [2018-12-08 22:33:45,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2212 transitions. [2018-12-08 22:33:45,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-08 22:33:45,353 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:33:45,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:33:45,377 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-08 22:33:45,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:33:45,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 1733 states and 2217 transitions. [2018-12-08 22:33:45,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2217 transitions. [2018-12-08 22:33:45,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-08 22:33:45,883 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:33:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:33:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-08 22:33:48,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:33:48,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 1745 states and 2231 transitions. [2018-12-08 22:33:48,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2231 transitions. [2018-12-08 22:33:48,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-08 22:33:48,464 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:33:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:33:48,728 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-08 22:33:49,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:33:49,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 1750 states and 2241 transitions. [2018-12-08 22:33:49,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2241 transitions. [2018-12-08 22:33:49,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-08 22:33:49,578 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:33:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:33:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:33:50,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:33:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2249 states to 1757 states and 2249 transitions. [2018-12-08 22:33:50,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 2249 transitions. [2018-12-08 22:33:50,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-08 22:33:50,329 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:33:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:33:50,355 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-08 22:33:51,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:33:51,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 1782 states and 2274 transitions. [2018-12-08 22:33:51,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2274 transitions. [2018-12-08 22:33:51,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-08 22:33:51,164 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:33:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:33:51,189 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-08 22:33:51,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:33:51,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 1787 states and 2279 transitions. [2018-12-08 22:33:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2279 transitions. [2018-12-08 22:33:51,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-08 22:33:51,769 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:33:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:33:51,796 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-08 22:33:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:33:52,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 1789 states and 2282 transitions. [2018-12-08 22:33:52,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2282 transitions. [2018-12-08 22:33:52,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-08 22:33:52,660 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:33:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:33:52,687 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-08 22:33:53,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:33:53,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2288 states to 1797 states and 2288 transitions. [2018-12-08 22:33:53,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2288 transitions. [2018-12-08 22:33:53,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-08 22:33:53,540 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:33:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:33:53,564 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-08 22:33:53,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:33:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 1816 states and 2307 transitions. [2018-12-08 22:33:53,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2307 transitions. [2018-12-08 22:33:53,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-08 22:33:53,810 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:33:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:33:53,832 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-08 22:33:57,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:33:57,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 1825 states and 2326 transitions. [2018-12-08 22:33:57,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2326 transitions. [2018-12-08 22:33:57,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-08 22:33:57,441 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:33:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:33:57,533 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-08 22:34:01,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:34:01,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 1828 states and 2328 transitions. [2018-12-08 22:34:01,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 2328 transitions. [2018-12-08 22:34:01,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-08 22:34:01,100 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:34:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:34:01,131 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-08 22:34:01,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:34:01,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 1829 states and 2328 transitions. [2018-12-08 22:34:01,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2328 transitions. [2018-12-08 22:34:01,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-08 22:34:01,575 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:34:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:34:01,639 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 22:34:02,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:34:02,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 1831 states and 2330 transitions. [2018-12-08 22:34:02,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2330 transitions. [2018-12-08 22:34:02,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-08 22:34:02,255 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:34:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:34:02,284 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 22:34:06,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:34:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2341 states to 1842 states and 2341 transitions. [2018-12-08 22:34:06,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2341 transitions. [2018-12-08 22:34:06,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-08 22:34:06,165 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:34:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:34:06,190 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 22:34:10,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:34:10,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 1859 states and 2364 transitions. [2018-12-08 22:34:10,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2364 transitions. [2018-12-08 22:34:10,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-08 22:34:10,403 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:34:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:34:10,428 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 22:34:12,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:34:12,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 1866 states and 2373 transitions. [2018-12-08 22:34:12,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 2373 transitions. [2018-12-08 22:34:12,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-08 22:34:12,519 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:34:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:34:12,544 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 22:34:14,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:34:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 1867 states and 2373 transitions. [2018-12-08 22:34:14,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2373 transitions. [2018-12-08 22:34:14,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-08 22:34:14,636 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:34:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:34:14,664 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 22:34:15,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:34:15,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 1868 states and 2373 transitions. [2018-12-08 22:34:15,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2373 transitions. [2018-12-08 22:34:15,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-08 22:34:15,154 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:34:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:34:15,181 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-12-08 22:34:15,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:34:15,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 1870 states and 2374 transitions. [2018-12-08 22:34:15,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2374 transitions. [2018-12-08 22:34:15,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-08 22:34:15,697 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:34:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:34:15,725 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-12-08 22:34:16,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:34:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 1871 states and 2374 transitions. [2018-12-08 22:34:16,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2374 transitions. [2018-12-08 22:34:16,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-08 22:34:16,102 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:34:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:34:16,227 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-12-08 22:34:18,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:34:18,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 1879 states and 2391 transitions. [2018-12-08 22:34:18,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 2391 transitions. [2018-12-08 22:34:18,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-08 22:34:18,170 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:34:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:34:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-08 22:34:27,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:34:27,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2429 states to 1910 states and 2429 transitions. [2018-12-08 22:34:27,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2429 transitions. [2018-12-08 22:34:27,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-08 22:34:27,583 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:34:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:34:27,697 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-12-08 22:34:28,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:34:28,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 1912 states and 2430 transitions. [2018-12-08 22:34:28,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2430 transitions. [2018-12-08 22:34:28,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-08 22:34:28,696 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:34:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:34:28,780 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-08 22:34:31,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:34:31,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2439 states to 1920 states and 2439 transitions. [2018-12-08 22:34:31,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 2439 transitions. [2018-12-08 22:34:31,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-08 22:34:31,789 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:34:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:34:31,883 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-08 22:34:36,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:34:36,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 1930 states and 2450 transitions. [2018-12-08 22:34:36,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2450 transitions. [2018-12-08 22:34:36,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-08 22:34:36,409 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:34:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:34:36,455 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 193 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-08 22:34:38,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:34:38,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2456 states to 1935 states and 2456 transitions. [2018-12-08 22:34:38,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2456 transitions. [2018-12-08 22:34:38,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-08 22:34:38,054 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:34:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:34:42,523 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-12-08 22:34:43,846 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2018-12-08 22:34:43,924 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 22:34:49,076 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-12-08 22:34:54,867 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-12-08 22:34:58,760 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-12-08 22:34:59,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:34:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2490 states to 1968 states and 2490 transitions. [2018-12-08 22:34:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 2490 transitions. [2018-12-08 22:34:59,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-08 22:34:59,307 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:34:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:34:59,399 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 22:35:00,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:35:00,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2502 states to 1980 states and 2502 transitions. [2018-12-08 22:35:00,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 2502 transitions. [2018-12-08 22:35:00,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-08 22:35:00,300 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:35:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:35:00,392 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 22:35:01,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:35:01,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 1983 states and 2506 transitions. [2018-12-08 22:35:01,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2506 transitions. [2018-12-08 22:35:01,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-08 22:35:01,868 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:35:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:35:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:35:03,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:35:03,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 1988 states and 2511 transitions. [2018-12-08 22:35:03,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1988 states and 2511 transitions. [2018-12-08 22:35:03,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-08 22:35:03,853 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:35:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:35:03,881 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:35:04,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:35:04,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 1990 states and 2511 transitions. [2018-12-08 22:35:04,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 2511 transitions. [2018-12-08 22:35:04,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-08 22:35:04,886 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:35:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:35:04,915 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-12-08 22:35:06,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:35:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2018 states and 2543 transitions. [2018-12-08 22:35:06,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 2543 transitions. [2018-12-08 22:35:06,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-08 22:35:06,374 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:35:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:35:06,402 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 22:35:07,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:35:07,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2023 states and 2550 transitions. [2018-12-08 22:35:07,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2023 states and 2550 transitions. [2018-12-08 22:35:07,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-08 22:35:07,145 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:35:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:35:08,001 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 170 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:35:17,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:35:17,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2612 states to 2077 states and 2612 transitions. [2018-12-08 22:35:17,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 2612 transitions. [2018-12-08 22:35:17,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-08 22:35:17,994 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:35:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:35:18,032 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-08 22:35:22,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:35:22,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2621 states to 2084 states and 2621 transitions. [2018-12-08 22:35:22,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2621 transitions. [2018-12-08 22:35:22,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-08 22:35:22,008 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:35:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:35:22,037 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 22:35:24,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:35:24,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2641 states to 2096 states and 2641 transitions. [2018-12-08 22:35:24,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 2641 transitions. [2018-12-08 22:35:24,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-08 22:35:24,668 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:35:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:35:24,700 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 22:35:28,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:35:28,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2656 states to 2111 states and 2656 transitions. [2018-12-08 22:35:28,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 2656 transitions. [2018-12-08 22:35:28,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-08 22:35:28,908 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:35:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:35:28,944 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 22:35:30,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:35:30,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2118 states and 2663 transitions. [2018-12-08 22:35:30,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2118 states and 2663 transitions. [2018-12-08 22:35:30,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-08 22:35:30,120 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:35:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:35:34,123 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2018-12-08 22:35:35,579 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2018-12-08 22:35:36,352 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:35:40,848 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2018-12-08 22:35:47,494 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2018-12-08 22:35:49,250 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 31 [2018-12-08 22:35:54,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:35:54,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2709 states to 2159 states and 2709 transitions. [2018-12-08 22:35:54,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 2709 transitions. [2018-12-08 22:35:54,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-08 22:35:54,297 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:35:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:35:54,486 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:35:57,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:35:57,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2180 states and 2728 transitions. [2018-12-08 22:35:57,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 2728 transitions. [2018-12-08 22:35:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-08 22:35:57,478 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:35:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:35:57,585 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:35:58,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:35:58,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2184 states and 2732 transitions. [2018-12-08 22:35:58,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 2732 transitions. [2018-12-08 22:35:58,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-08 22:35:58,218 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:35:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:35:58,325 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 22:35:58,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:35:58,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2737 states to 2189 states and 2737 transitions. [2018-12-08 22:35:58,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 2737 transitions. [2018-12-08 22:35:58,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-08 22:35:58,805 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:35:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:35:58,837 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-12-08 22:36:04,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 22:36:04,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2214 states and 2774 transitions. [2018-12-08 22:36:04,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 2774 transitions. [2018-12-08 22:36:04,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-08 22:36:04,245 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 22:36:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:36:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:36:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:36:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:36:04,422 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 185 iterations. [2018-12-08 22:36:04,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.12 10:36:04 ImpRootNode [2018-12-08 22:36:04,516 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-08 22:36:04,517 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 22:36:04,517 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 22:36:04,517 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 22:36:04,517 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:30:44" (3/4) ... [2018-12-08 22:36:04,519 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 22:36:04,610 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8838c216-226d-4844-9bae-6025185c9633/bin-2019/ukojak/witness.graphml [2018-12-08 22:36:04,610 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 22:36:04,611 INFO L168 Benchmark]: Toolchain (without parser) took 321293.74 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 945.3 MB in the beginning and 1.2 GB in the end (delta: -258.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-12-08 22:36:04,611 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 22:36:04,611 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 945.3 MB in the beginning and 1.2 GB in the end (delta: -211.2 MB). Peak memory consumption was 47.4 MB. Max. memory is 11.5 GB. [2018-12-08 22:36:04,611 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-08 22:36:04,611 INFO L168 Benchmark]: Boogie Preprocessor took 40.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-08 22:36:04,611 INFO L168 Benchmark]: RCFGBuilder took 1068.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 938.1 MB in the end (delta: 207.8 MB). Peak memory consumption was 207.8 MB. Max. memory is 11.5 GB. [2018-12-08 22:36:04,612 INFO L168 Benchmark]: CodeCheck took 319706.08 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 938.1 MB in the beginning and 1.2 GB in the end (delta: -290.9 MB). Peak memory consumption was 848.9 MB. Max. memory is 11.5 GB. [2018-12-08 22:36:04,612 INFO L168 Benchmark]: Witness Printer took 93.32 ms. Allocated memory is still 2.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-08 22:36:04,613 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, 198 locations, 1 error locations. UNSAFE Result, 319.5s OverallTime, 185 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 25714688 SDtfs, 1669616322 SDslu, 141705216 SDs, 0 SdLazy, 270230530 SolverSat, 731931556 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 681.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 169365 GetRequests, 165081 SyntacticMatches, 2298 SemanticMatches, 1986 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2648492 ImplicationChecksByTransitivity, 299.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.6s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 24.1s InterpolantComputationTime, 24579 NumberOfCodeBlocks, 24579 NumberOfCodeBlocksAsserted, 185 NumberOfCheckSat, 24201 ConstructedInterpolants, 0 QuantifiedInterpolants, 12842640 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 184 InterpolantComputations, 172 PerfectInterpolantSequences, 15895/16062 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: 416]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND TRUE (((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8)) [L55] a7 = 0 [L56] a20 = 1 [L57] a21 = 1 [L58] a16 = 4 [L59] a17 = 1 [L60] a8 = 13 [L61] return -1; VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L406] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1))) [L409] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1))) [L412] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L415] COND TRUE (((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L416] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 330.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 945.3 MB in the beginning and 1.2 GB in the end (delta: -211.2 MB). Peak memory consumption was 47.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1068.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 938.1 MB in the end (delta: 207.8 MB). Peak memory consumption was 207.8 MB. Max. memory is 11.5 GB. * CodeCheck took 319706.08 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 938.1 MB in the beginning and 1.2 GB in the end (delta: -290.9 MB). Peak memory consumption was 848.9 MB. Max. memory is 11.5 GB. * Witness Printer took 93.32 ms. Allocated memory is still 2.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...