./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label47.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_796b0df3-4013-4a24-9c97-bc8d55eecc5a/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_796b0df3-4013-4a24-9c97-bc8d55eecc5a/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_796b0df3-4013-4a24-9c97-bc8d55eecc5a/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_796b0df3-4013-4a24-9c97-bc8d55eecc5a/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label47.c -s /tmp/vcloud-vcloud-master/worker/run_dir_796b0df3-4013-4a24-9c97-bc8d55eecc5a/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_796b0df3-4013-4a24-9c97-bc8d55eecc5a/bin/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 db6e7a7f3be179438223abf82c6cabe8d26d1cb7 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-f470102 [2019-12-01 05:33:26,956 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-01 05:33:26,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-01 05:33:26,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-01 05:33:26,967 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-01 05:33:26,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-01 05:33:26,968 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-01 05:33:26,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-01 05:33:26,971 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-01 05:33:26,972 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-01 05:33:26,972 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-01 05:33:26,973 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-01 05:33:26,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-01 05:33:26,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-01 05:33:26,974 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-01 05:33:26,975 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-01 05:33:26,976 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-01 05:33:26,976 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-01 05:33:26,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-01 05:33:26,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-01 05:33:26,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-01 05:33:26,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-01 05:33:26,982 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-01 05:33:26,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-01 05:33:26,984 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-01 05:33:26,984 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-01 05:33:26,984 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-01 05:33:26,984 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-01 05:33:26,985 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-01 05:33:26,985 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-01 05:33:26,985 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-01 05:33:26,986 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-01 05:33:26,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-01 05:33:26,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-01 05:33:26,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-01 05:33:26,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-01 05:33:26,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-01 05:33:26,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-01 05:33:26,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-01 05:33:26,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-01 05:33:26,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-01 05:33:26,990 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_796b0df3-4013-4a24-9c97-bc8d55eecc5a/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-12-01 05:33:26,999 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-01 05:33:26,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-01 05:33:27,000 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-01 05:33:27,000 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-12-01 05:33:27,000 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-01 05:33:27,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-01 05:33:27,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-01 05:33:27,001 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-01 05:33:27,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-01 05:33:27,001 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-01 05:33:27,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-01 05:33:27,001 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-01 05:33:27,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-01 05:33:27,001 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-01 05:33:27,002 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-01 05:33:27,002 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-01 05:33:27,002 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-01 05:33:27,002 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-01 05:33:27,002 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-01 05:33:27,002 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-01 05:33:27,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-01 05:33:27,002 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-01 05:33:27,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-01 05:33:27,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-01 05:33:27,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-01 05:33:27,003 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-01 05:33:27,003 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-12-01 05:33:27,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-01 05:33:27,003 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-01 05:33:27,003 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_796b0df3-4013-4a24-9c97-bc8d55eecc5a/bin/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 -> db6e7a7f3be179438223abf82c6cabe8d26d1cb7 [2019-12-01 05:33:27,102 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-01 05:33:27,109 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-01 05:33:27,112 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-01 05:33:27,113 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-01 05:33:27,113 INFO L275 PluginConnector]: CDTParser initialized [2019-12-01 05:33:27,113 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_796b0df3-4013-4a24-9c97-bc8d55eecc5a/bin/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label47.c [2019-12-01 05:33:27,151 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_796b0df3-4013-4a24-9c97-bc8d55eecc5a/bin/ukojak/data/e3b129c4a/256733ecc1e547b0bcc2515338cd0846/FLAGf24f9c8ba [2019-12-01 05:33:27,634 INFO L306 CDTParser]: Found 1 translation units. [2019-12-01 05:33:27,635 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_796b0df3-4013-4a24-9c97-bc8d55eecc5a/sv-benchmarks/c/eca-rers2012/Problem01_label47.c [2019-12-01 05:33:27,645 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_796b0df3-4013-4a24-9c97-bc8d55eecc5a/bin/ukojak/data/e3b129c4a/256733ecc1e547b0bcc2515338cd0846/FLAGf24f9c8ba [2019-12-01 05:33:27,656 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_796b0df3-4013-4a24-9c97-bc8d55eecc5a/bin/ukojak/data/e3b129c4a/256733ecc1e547b0bcc2515338cd0846 [2019-12-01 05:33:27,658 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-01 05:33:27,658 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-01 05:33:27,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-01 05:33:27,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-01 05:33:27,662 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-01 05:33:27,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:33:27" (1/1) ... [2019-12-01 05:33:27,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c51c803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:33:27, skipping insertion in model container [2019-12-01 05:33:27,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:33:27" (1/1) ... [2019-12-01 05:33:27,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-01 05:33:27,697 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-01 05:33:27,945 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 05:33:27,948 INFO L203 MainTranslator]: Completed pre-run [2019-12-01 05:33:28,021 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 05:33:28,032 INFO L208 MainTranslator]: Completed translation [2019-12-01 05:33:28,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:33:28 WrapperNode [2019-12-01 05:33:28,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-01 05:33:28,033 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-01 05:33:28,033 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-01 05:33:28,033 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-01 05:33:28,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:33:28" (1/1) ... [2019-12-01 05:33:28,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:33:28" (1/1) ... [2019-12-01 05:33:28,082 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-01 05:33:28,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-01 05:33:28,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-01 05:33:28,082 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-01 05:33:28,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:33:28" (1/1) ... [2019-12-01 05:33:28,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:33:28" (1/1) ... [2019-12-01 05:33:28,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:33:28" (1/1) ... [2019-12-01 05:33:28,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:33:28" (1/1) ... [2019-12-01 05:33:28,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:33:28" (1/1) ... [2019-12-01 05:33:28,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:33:28" (1/1) ... [2019-12-01 05:33:28,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:33:28" (1/1) ... [2019-12-01 05:33:28,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-01 05:33:28,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-01 05:33:28,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-01 05:33:28,122 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-01 05:33:28,123 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:33:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_796b0df3-4013-4a24-9c97-bc8d55eecc5a/bin/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 [2019-12-01 05:33:28,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-01 05:33:28,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-01 05:33:29,199 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-01 05:33:29,199 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-01 05:33:29,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:33:29 BoogieIcfgContainer [2019-12-01 05:33:29,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-01 05:33:29,200 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-01 05:33:29,200 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-01 05:33:29,208 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-01 05:33:29,208 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:33:29" (1/1) ... [2019-12-01 05:33:29,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-01 05:33:29,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:29,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2019-12-01 05:33:29,242 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2019-12-01 05:33:29,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-01 05:33:29,245 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:29,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:29,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:29,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 145 states and 239 transitions. [2019-12-01 05:33:29,802 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 239 transitions. [2019-12-01 05:33:29,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-01 05:33:29,804 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:29,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:30,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:30,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 146 states and 240 transitions. [2019-12-01 05:33:30,018 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 240 transitions. [2019-12-01 05:33:30,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-01 05:33:30,019 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:30,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:30,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:30,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 150 states and 247 transitions. [2019-12-01 05:33:30,137 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 247 transitions. [2019-12-01 05:33:30,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-01 05:33:30,138 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:30,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:30,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 151 states and 249 transitions. [2019-12-01 05:33:30,217 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 249 transitions. [2019-12-01 05:33:30,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-01 05:33:30,221 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:30,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:30,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:30,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 221 states and 323 transitions. [2019-12-01 05:33:30,736 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 323 transitions. [2019-12-01 05:33:30,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-01 05:33:30,737 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:31,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:31,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 228 states and 337 transitions. [2019-12-01 05:33:31,035 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 337 transitions. [2019-12-01 05:33:31,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-01 05:33:31,036 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:31,056 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 05:33:31,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:31,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 229 states and 338 transitions. [2019-12-01 05:33:31,101 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 338 transitions. [2019-12-01 05:33:31,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-01 05:33:31,102 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:31,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:31,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:31,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 232 states and 343 transitions. [2019-12-01 05:33:31,179 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 343 transitions. [2019-12-01 05:33:31,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-01 05:33:31,179 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:31,241 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:31,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:31,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 240 states and 359 transitions. [2019-12-01 05:33:31,813 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 359 transitions. [2019-12-01 05:33:31,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-01 05:33:31,814 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:31,858 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-01 05:33:32,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:32,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 245 states and 368 transitions. [2019-12-01 05:33:32,042 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 368 transitions. [2019-12-01 05:33:32,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 05:33:32,043 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:32,065 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:32,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:32,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 248 states and 371 transitions. [2019-12-01 05:33:32,260 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 371 transitions. [2019-12-01 05:33:32,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-01 05:33:32,260 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:32,275 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:32,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:32,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 253 states and 377 transitions. [2019-12-01 05:33:32,308 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 377 transitions. [2019-12-01 05:33:32,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-01 05:33:32,309 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:32,326 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 05:33:32,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 258 states and 385 transitions. [2019-12-01 05:33:32,482 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 385 transitions. [2019-12-01 05:33:32,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-01 05:33:32,482 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:32,499 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 05:33:32,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:32,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 259 states and 386 transitions. [2019-12-01 05:33:32,559 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 386 transitions. [2019-12-01 05:33:32,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-01 05:33:32,560 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:32,577 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 05:33:32,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:32,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 262 states and 389 transitions. [2019-12-01 05:33:32,682 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 389 transitions. [2019-12-01 05:33:32,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-01 05:33:32,682 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:32,776 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:33,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:33,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 276 states and 411 transitions. [2019-12-01 05:33:33,513 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 411 transitions. [2019-12-01 05:33:33,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-01 05:33:33,514 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:33,533 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:33,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:33,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 280 states and 418 transitions. [2019-12-01 05:33:33,722 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 418 transitions. [2019-12-01 05:33:33,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-01 05:33:33,723 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:33,748 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 05:33:33,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:33,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 281 states and 419 transitions. [2019-12-01 05:33:33,819 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 419 transitions. [2019-12-01 05:33:33,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-01 05:33:33,820 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:33,874 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:34,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:34,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 291 states and 430 transitions. [2019-12-01 05:33:34,434 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 430 transitions. [2019-12-01 05:33:34,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-01 05:33:34,434 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:34,452 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 05:33:34,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:34,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 296 states and 435 transitions. [2019-12-01 05:33:34,483 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 435 transitions. [2019-12-01 05:33:34,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-01 05:33:34,483 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:34,501 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 05:33:34,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:34,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 297 states and 435 transitions. [2019-12-01 05:33:34,569 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 435 transitions. [2019-12-01 05:33:34,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-01 05:33:34,570 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:34,586 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:35,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:35,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 307 states and 446 transitions. [2019-12-01 05:33:35,060 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 446 transitions. [2019-12-01 05:33:35,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-01 05:33:35,061 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:35,116 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:35,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:35,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 325 states and 472 transitions. [2019-12-01 05:33:35,868 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 472 transitions. [2019-12-01 05:33:35,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-01 05:33:35,870 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:35,890 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-01 05:33:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:36,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 329 states and 479 transitions. [2019-12-01 05:33:36,026 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 479 transitions. [2019-12-01 05:33:36,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-01 05:33:36,027 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:36,042 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 05:33:36,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:36,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 336 states and 489 transitions. [2019-12-01 05:33:36,187 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 489 transitions. [2019-12-01 05:33:36,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-01 05:33:36,188 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:36,208 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 05:33:36,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:36,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 338 states and 490 transitions. [2019-12-01 05:33:36,299 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 490 transitions. [2019-12-01 05:33:36,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-01 05:33:36,299 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:36,314 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-01 05:33:36,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:36,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 339 states and 492 transitions. [2019-12-01 05:33:36,493 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 492 transitions. [2019-12-01 05:33:36,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-01 05:33:36,494 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:36,509 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-01 05:33:36,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:36,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 340 states and 494 transitions. [2019-12-01 05:33:36,619 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 494 transitions. [2019-12-01 05:33:36,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-01 05:33:36,620 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:36,635 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:36,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:36,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 347 states and 503 transitions. [2019-12-01 05:33:36,783 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 503 transitions. [2019-12-01 05:33:36,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-01 05:33:36,784 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:36,799 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-01 05:33:36,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:36,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 349 states and 505 transitions. [2019-12-01 05:33:36,891 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 505 transitions. [2019-12-01 05:33:36,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-01 05:33:36,892 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:36,965 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:38,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:38,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 376 states and 541 transitions. [2019-12-01 05:33:38,213 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 541 transitions. [2019-12-01 05:33:38,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-01 05:33:38,213 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:38,280 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:39,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:39,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 398 states and 577 transitions. [2019-12-01 05:33:39,857 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 577 transitions. [2019-12-01 05:33:39,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-01 05:33:39,858 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:39,893 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:40,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:40,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 402 states and 580 transitions. [2019-12-01 05:33:40,046 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 580 transitions. [2019-12-01 05:33:40,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-01 05:33:40,046 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:40,126 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:40,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:40,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 418 states and 599 transitions. [2019-12-01 05:33:40,933 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 599 transitions. [2019-12-01 05:33:40,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-01 05:33:40,934 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:40,952 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 05:33:41,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:41,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 425 states and 608 transitions. [2019-12-01 05:33:41,142 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 608 transitions. [2019-12-01 05:33:41,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-01 05:33:41,143 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:41,161 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-01 05:33:41,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:41,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 430 states and 613 transitions. [2019-12-01 05:33:41,185 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 613 transitions. [2019-12-01 05:33:41,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-01 05:33:41,186 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:41,206 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-01 05:33:41,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:41,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 431 states and 614 transitions. [2019-12-01 05:33:41,323 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 614 transitions. [2019-12-01 05:33:41,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-01 05:33:41,324 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:41,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 434 states and 617 transitions. [2019-12-01 05:33:41,458 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 617 transitions. [2019-12-01 05:33:41,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-01 05:33:41,458 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:41,487 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:42,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:42,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 455 states and 642 transitions. [2019-12-01 05:33:42,246 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 642 transitions. [2019-12-01 05:33:42,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-01 05:33:42,247 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:42,278 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:43,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:43,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 466 states and 652 transitions. [2019-12-01 05:33:43,261 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 652 transitions. [2019-12-01 05:33:43,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-01 05:33:43,262 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:43,606 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:45,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:45,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 473 states and 664 transitions. [2019-12-01 05:33:45,677 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 664 transitions. [2019-12-01 05:33:45,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-01 05:33:45,677 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:45,700 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 05:33:45,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:45,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 480 states and 671 transitions. [2019-12-01 05:33:45,901 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 671 transitions. [2019-12-01 05:33:45,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-01 05:33:45,901 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:45,922 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 05:33:45,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 487 states and 678 transitions. [2019-12-01 05:33:45,959 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 678 transitions. [2019-12-01 05:33:45,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-01 05:33:45,960 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:45,979 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 05:33:46,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:46,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 489 states and 682 transitions. [2019-12-01 05:33:46,077 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 682 transitions. [2019-12-01 05:33:46,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-01 05:33:46,078 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:46,099 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 05:33:46,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:46,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 491 states and 684 transitions. [2019-12-01 05:33:46,120 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 684 transitions. [2019-12-01 05:33:46,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-01 05:33:46,121 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:46,201 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-01 05:33:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:46,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 495 states and 690 transitions. [2019-12-01 05:33:46,654 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 690 transitions. [2019-12-01 05:33:46,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-01 05:33:46,655 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:46,875 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:50,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 525 states and 728 transitions. [2019-12-01 05:33:50,939 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 728 transitions. [2019-12-01 05:33:50,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-12-01 05:33:50,940 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:50,969 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:51,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:51,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 539 states and 749 transitions. [2019-12-01 05:33:51,589 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 749 transitions. [2019-12-01 05:33:51,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-12-01 05:33:51,590 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:51,617 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:52,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 545 states and 756 transitions. [2019-12-01 05:33:52,035 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 756 transitions. [2019-12-01 05:33:52,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-12-01 05:33:52,035 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:52,062 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:52,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:52,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 552 states and 763 transitions. [2019-12-01 05:33:52,275 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 763 transitions. [2019-12-01 05:33:52,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-12-01 05:33:52,275 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:52,306 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:52,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:52,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 557 states and 769 transitions. [2019-12-01 05:33:52,547 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 769 transitions. [2019-12-01 05:33:52,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-01 05:33:52,548 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:54,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:54,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 587 states and 806 transitions. [2019-12-01 05:33:54,529 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 806 transitions. [2019-12-01 05:33:54,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-01 05:33:54,529 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:54,552 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:55,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:55,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 602 states and 823 transitions. [2019-12-01 05:33:55,286 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 823 transitions. [2019-12-01 05:33:55,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-01 05:33:55,287 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:55,305 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:55,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 606 states and 829 transitions. [2019-12-01 05:33:55,331 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 829 transitions. [2019-12-01 05:33:55,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-01 05:33:55,331 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:55,397 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:56,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:56,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 611 states and 838 transitions. [2019-12-01 05:33:56,103 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 838 transitions. [2019-12-01 05:33:56,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-01 05:33:56,104 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:56,136 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-01 05:33:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 614 states and 841 transitions. [2019-12-01 05:33:56,510 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 841 transitions. [2019-12-01 05:33:56,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-01 05:33:56,511 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:56,542 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 620 states and 850 transitions. [2019-12-01 05:33:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 850 transitions. [2019-12-01 05:33:57,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-01 05:33:57,129 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:57,157 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:57,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:57,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 621 states and 852 transitions. [2019-12-01 05:33:57,454 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 852 transitions. [2019-12-01 05:33:57,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-01 05:33:57,454 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:57,488 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:57,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:57,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 622 states and 854 transitions. [2019-12-01 05:33:57,786 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 854 transitions. [2019-12-01 05:33:57,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-01 05:33:57,787 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:57,815 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:58,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:58,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 623 states and 855 transitions. [2019-12-01 05:33:58,075 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 855 transitions. [2019-12-01 05:33:58,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-01 05:33:58,076 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:58,103 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:33:58,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:58,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 629 states and 863 transitions. [2019-12-01 05:33:58,749 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 863 transitions. [2019-12-01 05:33:58,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-01 05:33:58,750 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:58,770 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 05:33:59,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:33:59,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 638 states and 871 transitions. [2019-12-01 05:33:59,548 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 871 transitions. [2019-12-01 05:33:59,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-01 05:33:59,549 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:33:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:33:59,695 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:34:01,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:01,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 663 states and 912 transitions. [2019-12-01 05:34:01,626 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 912 transitions. [2019-12-01 05:34:01,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-01 05:34:01,626 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:01,756 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:34:04,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:04,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 675 states and 932 transitions. [2019-12-01 05:34:04,018 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 932 transitions. [2019-12-01 05:34:04,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-01 05:34:04,019 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:04,215 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-01 05:34:04,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:04,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 700 states and 958 transitions. [2019-12-01 05:34:04,905 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 958 transitions. [2019-12-01 05:34:04,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-01 05:34:04,906 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:34:05,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:05,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 711 states and 974 transitions. [2019-12-01 05:34:05,950 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 974 transitions. [2019-12-01 05:34:05,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-01 05:34:05,951 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:05,970 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 05:34:07,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:07,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 718 states and 982 transitions. [2019-12-01 05:34:07,774 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 982 transitions. [2019-12-01 05:34:07,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-01 05:34:07,776 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:07,804 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 05:34:08,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 719 states and 983 transitions. [2019-12-01 05:34:08,344 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 983 transitions. [2019-12-01 05:34:08,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-01 05:34:08,346 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 05:34:08,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:08,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 721 states and 984 transitions. [2019-12-01 05:34:08,520 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 984 transitions. [2019-12-01 05:34:08,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-01 05:34:08,521 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:08,541 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 05:34:08,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:08,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 723 states and 985 transitions. [2019-12-01 05:34:08,717 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 985 transitions. [2019-12-01 05:34:08,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-01 05:34:08,718 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:08,738 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 05:34:08,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 733 states and 996 transitions. [2019-12-01 05:34:08,776 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 996 transitions. [2019-12-01 05:34:08,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-01 05:34:08,777 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:08,797 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 05:34:08,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:08,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 734 states and 997 transitions. [2019-12-01 05:34:08,942 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 997 transitions. [2019-12-01 05:34:08,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-01 05:34:08,943 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-01 05:34:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:10,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 747 states and 1019 transitions. [2019-12-01 05:34:10,333 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1019 transitions. [2019-12-01 05:34:10,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-01 05:34:10,334 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:10,724 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:34:13,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 789 states and 1063 transitions. [2019-12-01 05:34:13,835 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1063 transitions. [2019-12-01 05:34:13,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-01 05:34:13,835 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:34:15,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 799 states and 1083 transitions. [2019-12-01 05:34:15,243 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1083 transitions. [2019-12-01 05:34:15,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-01 05:34:15,244 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:34:15,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:15,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 800 states and 1083 transitions. [2019-12-01 05:34:15,442 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1083 transitions. [2019-12-01 05:34:15,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-01 05:34:15,443 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:15,485 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:34:15,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:15,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 801 states and 1084 transitions. [2019-12-01 05:34:15,807 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1084 transitions. [2019-12-01 05:34:15,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-12-01 05:34:15,807 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:15,839 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-01 05:34:16,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:16,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 811 states and 1096 transitions. [2019-12-01 05:34:16,880 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1096 transitions. [2019-12-01 05:34:16,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-12-01 05:34:16,880 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:16,912 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-01 05:34:17,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 813 states and 1098 transitions. [2019-12-01 05:34:17,182 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1098 transitions. [2019-12-01 05:34:17,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-12-01 05:34:17,183 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:17,211 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:34:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:19,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 827 states and 1120 transitions. [2019-12-01 05:34:19,611 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1120 transitions. [2019-12-01 05:34:19,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-12-01 05:34:19,613 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:19,650 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:34:20,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:20,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 830 states and 1124 transitions. [2019-12-01 05:34:20,293 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1124 transitions. [2019-12-01 05:34:20,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-12-01 05:34:20,294 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:20,322 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:34:20,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:20,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 832 states and 1126 transitions. [2019-12-01 05:34:20,900 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1126 transitions. [2019-12-01 05:34:20,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-12-01 05:34:20,901 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:20,922 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:34:21,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:21,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 837 states and 1132 transitions. [2019-12-01 05:34:21,254 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1132 transitions. [2019-12-01 05:34:21,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-01 05:34:21,255 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:21,278 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-01 05:34:21,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:21,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 839 states and 1135 transitions. [2019-12-01 05:34:21,437 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1135 transitions. [2019-12-01 05:34:21,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-01 05:34:21,438 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:21,460 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-01 05:34:21,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:21,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 840 states and 1136 transitions. [2019-12-01 05:34:21,478 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1136 transitions. [2019-12-01 05:34:21,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-01 05:34:21,479 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:21,507 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 05:34:24,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:24,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 878 states and 1181 transitions. [2019-12-01 05:34:24,867 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1181 transitions. [2019-12-01 05:34:24,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-01 05:34:24,868 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:24,895 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 05:34:25,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:25,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 889 states and 1191 transitions. [2019-12-01 05:34:25,685 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1191 transitions. [2019-12-01 05:34:25,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-01 05:34:25,686 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 05:34:27,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:27,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 933 states and 1237 transitions. [2019-12-01 05:34:27,689 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1237 transitions. [2019-12-01 05:34:27,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-01 05:34:27,691 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 05:34:28,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 936 states and 1240 transitions. [2019-12-01 05:34:28,715 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1240 transitions. [2019-12-01 05:34:28,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-01 05:34:28,717 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:28,752 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 05:34:28,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:28,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 937 states and 1240 transitions. [2019-12-01 05:34:28,817 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1240 transitions. [2019-12-01 05:34:28,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-01 05:34:28,818 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:28,846 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 05:34:29,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:29,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 938 states and 1240 transitions. [2019-12-01 05:34:29,060 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1240 transitions. [2019-12-01 05:34:29,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-12-01 05:34:29,061 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-01 05:34:33,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:33,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 957 states and 1270 transitions. [2019-12-01 05:34:33,247 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1270 transitions. [2019-12-01 05:34:33,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-01 05:34:33,248 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:33,271 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-01 05:34:33,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:33,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 959 states and 1273 transitions. [2019-12-01 05:34:33,989 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1273 transitions. [2019-12-01 05:34:33,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-01 05:34:33,990 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:34,013 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-01 05:34:34,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:34,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 961 states and 1276 transitions. [2019-12-01 05:34:34,850 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1276 transitions. [2019-12-01 05:34:34,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-01 05:34:34,852 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:34,882 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-01 05:34:36,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:36,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 974 states and 1296 transitions. [2019-12-01 05:34:36,716 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1296 transitions. [2019-12-01 05:34:36,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-01 05:34:36,718 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:36,740 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-01 05:34:37,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:37,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 975 states and 1297 transitions. [2019-12-01 05:34:37,061 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1297 transitions. [2019-12-01 05:34:37,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-01 05:34:37,062 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:37,230 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:34:38,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:38,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1045 states and 1371 transitions. [2019-12-01 05:34:38,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1371 transitions. [2019-12-01 05:34:38,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-01 05:34:38,507 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:38,541 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:34:39,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:39,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1061 states and 1390 transitions. [2019-12-01 05:34:39,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1390 transitions. [2019-12-01 05:34:39,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-01 05:34:39,648 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:39,683 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:34:39,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:39,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1062 states and 1391 transitions. [2019-12-01 05:34:39,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1391 transitions. [2019-12-01 05:34:39,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-01 05:34:39,704 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:39,738 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:34:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:39,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1064 states and 1392 transitions. [2019-12-01 05:34:39,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1392 transitions. [2019-12-01 05:34:39,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-01 05:34:39,959 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:39,995 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:34:40,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:40,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1071 states and 1399 transitions. [2019-12-01 05:34:40,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1399 transitions. [2019-12-01 05:34:40,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-01 05:34:40,319 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:40,341 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-01 05:34:40,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:40,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1073 states and 1400 transitions. [2019-12-01 05:34:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1400 transitions. [2019-12-01 05:34:40,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-01 05:34:40,751 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:40,773 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-01 05:34:40,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:40,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1074 states and 1400 transitions. [2019-12-01 05:34:40,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1400 transitions. [2019-12-01 05:34:40,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-12-01 05:34:40,987 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:41,059 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-01 05:34:41,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:41,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1085 states and 1414 transitions. [2019-12-01 05:34:41,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1414 transitions. [2019-12-01 05:34:41,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-12-01 05:34:41,850 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:42,305 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 95 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-01 05:34:46,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:46,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1100 states and 1434 transitions. [2019-12-01 05:34:46,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1434 transitions. [2019-12-01 05:34:46,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-12-01 05:34:46,477 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:46,549 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-01 05:34:46,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:46,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1101 states and 1435 transitions. [2019-12-01 05:34:46,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1435 transitions. [2019-12-01 05:34:46,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-12-01 05:34:46,603 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:47,629 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:34:50,893 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-12-01 05:34:51,901 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-12-01 05:34:56,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:34:56,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1168 states and 1507 transitions. [2019-12-01 05:34:56,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1507 transitions. [2019-12-01 05:34:56,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-01 05:34:56,737 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:34:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:34:58,266 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:35:13,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:35:13,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1277 states and 1631 transitions. [2019-12-01 05:35:13,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1631 transitions. [2019-12-01 05:35:13,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-01 05:35:13,329 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:35:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:35:13,413 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-01 05:35:15,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:35:15,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1291 states and 1646 transitions. [2019-12-01 05:35:15,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1646 transitions. [2019-12-01 05:35:15,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-01 05:35:15,114 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:35:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:35:15,195 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-01 05:35:18,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:35:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1317 states and 1671 transitions. [2019-12-01 05:35:18,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1671 transitions. [2019-12-01 05:35:18,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-01 05:35:18,752 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:35:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:35:18,831 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-01 05:35:19,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:35:19,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1319 states and 1673 transitions. [2019-12-01 05:35:19,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1673 transitions. [2019-12-01 05:35:19,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-01 05:35:19,243 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:35:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:35:19,324 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-12-01 05:35:24,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:35:24,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1344 states and 1703 transitions. [2019-12-01 05:35:24,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 1703 transitions. [2019-12-01 05:35:24,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-01 05:35:24,332 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:35:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:35:24,368 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-01 05:35:24,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:35:24,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1355 states and 1715 transitions. [2019-12-01 05:35:24,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1715 transitions. [2019-12-01 05:35:24,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-01 05:35:24,424 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:35:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:35:24,453 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-01 05:35:25,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:35:25,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1366 states and 1730 transitions. [2019-12-01 05:35:25,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1730 transitions. [2019-12-01 05:35:25,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-01 05:35:25,650 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:35:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:35:25,679 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-01 05:35:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:35:26,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1371 states and 1736 transitions. [2019-12-01 05:35:26,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1736 transitions. [2019-12-01 05:35:26,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-01 05:35:26,108 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:35:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:35:26,137 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-01 05:35:26,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:35:26,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1381 states and 1747 transitions. [2019-12-01 05:35:26,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1747 transitions. [2019-12-01 05:35:26,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-01 05:35:26,988 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:35:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:35:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-01 05:35:27,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:35:27,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1387 states and 1755 transitions. [2019-12-01 05:35:27,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 1755 transitions. [2019-12-01 05:35:27,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-01 05:35:27,593 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:35:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:35:27,622 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-01 05:35:27,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:35:27,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1388 states and 1755 transitions. [2019-12-01 05:35:27,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1755 transitions. [2019-12-01 05:35:27,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-01 05:35:27,878 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:35:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:35:28,602 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 109 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-01 05:35:35,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:35:35,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1418 states and 1792 transitions. [2019-12-01 05:35:35,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1792 transitions. [2019-12-01 05:35:35,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-01 05:35:35,951 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:35:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:35:36,014 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 109 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-01 05:35:37,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:35:37,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1420 states and 1794 transitions. [2019-12-01 05:35:37,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1794 transitions. [2019-12-01 05:35:37,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-01 05:35:37,092 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:35:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:35:37,159 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 109 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-01 05:35:39,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:35:39,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1427 states and 1801 transitions. [2019-12-01 05:35:39,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1801 transitions. [2019-12-01 05:35:39,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-01 05:35:39,355 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:35:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:35:39,394 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-01 05:35:39,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:35:39,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1428 states and 1802 transitions. [2019-12-01 05:35:39,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1802 transitions. [2019-12-01 05:35:39,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-01 05:35:39,423 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:35:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:35:39,453 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-01 05:35:39,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:35:39,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1429 states and 1804 transitions. [2019-12-01 05:35:39,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1804 transitions. [2019-12-01 05:35:39,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-01 05:35:39,483 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:35:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:35:39,563 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-01 05:35:40,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:35:40,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1433 states and 1809 transitions. [2019-12-01 05:35:40,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1809 transitions. [2019-12-01 05:35:40,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-01 05:35:40,488 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:35:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:35:40,538 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-01 05:35:45,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:35:45,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1450 states and 1831 transitions. [2019-12-01 05:35:45,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 1831 transitions. [2019-12-01 05:35:45,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-01 05:35:45,116 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:35:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:35:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:35:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:35:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1456 states and 1838 transitions. [2019-12-01 05:35:46,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1838 transitions. [2019-12-01 05:35:46,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-01 05:35:46,647 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:35:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:35:46,725 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:35:49,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:35:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1521 states and 1902 transitions. [2019-12-01 05:35:49,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1902 transitions. [2019-12-01 05:35:49,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-01 05:35:49,316 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:35:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:35:49,357 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-01 05:35:52,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:35:52,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1529 states and 1915 transitions. [2019-12-01 05:35:52,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 1915 transitions. [2019-12-01 05:35:52,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-12-01 05:35:52,462 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:35:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:35:52,493 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-01 05:35:54,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:35:54,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1535 states and 1926 transitions. [2019-12-01 05:35:54,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 1926 transitions. [2019-12-01 05:35:54,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-01 05:35:54,246 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:35:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:35:54,301 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-01 05:35:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:35:54,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1538 states and 1930 transitions. [2019-12-01 05:35:54,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 1930 transitions. [2019-12-01 05:35:54,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-01 05:35:54,901 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:35:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:35:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-01 05:36:00,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:00,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1956 states to 1560 states and 1956 transitions. [2019-12-01 05:36:00,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1956 transitions. [2019-12-01 05:36:00,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-12-01 05:36:00,442 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:00,476 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-01 05:36:01,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:01,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1567 states and 1964 transitions. [2019-12-01 05:36:01,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 1964 transitions. [2019-12-01 05:36:01,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-01 05:36:01,253 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:01,553 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-01 05:36:02,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:02,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1572 states and 1971 transitions. [2019-12-01 05:36:02,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 1971 transitions. [2019-12-01 05:36:02,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-12-01 05:36:02,451 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:02,492 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-01 05:36:04,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:04,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1582 states and 1986 transitions. [2019-12-01 05:36:04,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 1986 transitions. [2019-12-01 05:36:04,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-01 05:36:04,436 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:05,673 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 98 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:36:08,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:08,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 1599 states and 2005 transitions. [2019-12-01 05:36:08,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2005 transitions. [2019-12-01 05:36:08,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-12-01 05:36:08,539 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:08,591 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-01 05:36:13,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:13,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2031 states to 1615 states and 2031 transitions. [2019-12-01 05:36:13,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2031 transitions. [2019-12-01 05:36:13,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-12-01 05:36:13,900 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:13,946 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-01 05:36:16,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:16,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 1627 states and 2053 transitions. [2019-12-01 05:36:16,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 2053 transitions. [2019-12-01 05:36:16,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-12-01 05:36:16,953 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-01 05:36:18,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:18,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 1631 states and 2057 transitions. [2019-12-01 05:36:18,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2057 transitions. [2019-12-01 05:36:18,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-01 05:36:18,507 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:18,545 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-01 05:36:18,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:18,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 1636 states and 2065 transitions. [2019-12-01 05:36:18,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2065 transitions. [2019-12-01 05:36:18,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-01 05:36:18,846 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:18,882 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-01 05:36:21,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:21,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 1651 states and 2087 transitions. [2019-12-01 05:36:21,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2087 transitions. [2019-12-01 05:36:21,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-01 05:36:21,490 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:21,534 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-01 05:36:21,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:21,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 1653 states and 2088 transitions. [2019-12-01 05:36:21,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2088 transitions. [2019-12-01 05:36:21,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-01 05:36:21,846 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:21,881 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-01 05:36:22,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:22,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 1657 states and 2093 transitions. [2019-12-01 05:36:22,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2093 transitions. [2019-12-01 05:36:22,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-01 05:36:22,818 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:22,852 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-01 05:36:23,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:23,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 1662 states and 2100 transitions. [2019-12-01 05:36:23,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2100 transitions. [2019-12-01 05:36:23,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-01 05:36:23,770 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:23,987 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-01 05:36:25,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:25,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 1667 states and 2112 transitions. [2019-12-01 05:36:25,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2112 transitions. [2019-12-01 05:36:25,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-01 05:36:25,746 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:25,789 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-01 05:36:27,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:27,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 1674 states and 2120 transitions. [2019-12-01 05:36:27,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2120 transitions. [2019-12-01 05:36:27,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-12-01 05:36:27,186 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:27,224 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-01 05:36:29,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:29,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 1701 states and 2150 transitions. [2019-12-01 05:36:29,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2150 transitions. [2019-12-01 05:36:29,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-12-01 05:36:29,012 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:29,049 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-12-01 05:36:31,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:31,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 1709 states and 2163 transitions. [2019-12-01 05:36:31,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2163 transitions. [2019-12-01 05:36:31,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-12-01 05:36:31,890 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:31,940 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-01 05:36:32,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:32,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 1716 states and 2170 transitions. [2019-12-01 05:36:32,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2170 transitions. [2019-12-01 05:36:32,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-12-01 05:36:32,840 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:32,889 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-01 05:36:36,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:36,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2177 states to 1726 states and 2177 transitions. [2019-12-01 05:36:36,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2177 transitions. [2019-12-01 05:36:36,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-12-01 05:36:36,610 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:36,659 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-01 05:36:37,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:37,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 1727 states and 2180 transitions. [2019-12-01 05:36:37,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2180 transitions. [2019-12-01 05:36:37,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-12-01 05:36:37,396 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:37,447 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-01 05:36:38,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:38,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 1729 states and 2183 transitions. [2019-12-01 05:36:38,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2183 transitions. [2019-12-01 05:36:38,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-12-01 05:36:38,388 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:38,423 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-12-01 05:36:38,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:38,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 1748 states and 2202 transitions. [2019-12-01 05:36:38,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2202 transitions. [2019-12-01 05:36:38,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-12-01 05:36:38,736 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-01 05:36:41,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:41,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 1757 states and 2218 transitions. [2019-12-01 05:36:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 2218 transitions. [2019-12-01 05:36:41,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-12-01 05:36:41,742 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-01 05:36:43,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:43,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 1759 states and 2220 transitions. [2019-12-01 05:36:43,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2220 transitions. [2019-12-01 05:36:43,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-12-01 05:36:43,211 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-01 05:36:43,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:43,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 1761 states and 2222 transitions. [2019-12-01 05:36:43,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2222 transitions. [2019-12-01 05:36:43,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-12-01 05:36:43,848 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:43,879 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-01 05:36:44,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:44,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 1764 states and 2226 transitions. [2019-12-01 05:36:44,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 2226 transitions. [2019-12-01 05:36:44,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-12-01 05:36:44,815 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:44,855 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-01 05:36:48,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:48,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 1775 states and 2237 transitions. [2019-12-01 05:36:48,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2237 transitions. [2019-12-01 05:36:48,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-12-01 05:36:48,088 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:48,124 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-01 05:36:52,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:52,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 1792 states and 2259 transitions. [2019-12-01 05:36:52,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2259 transitions. [2019-12-01 05:36:52,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-12-01 05:36:52,019 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:52,056 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-01 05:36:52,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:52,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 1793 states and 2260 transitions. [2019-12-01 05:36:52,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2260 transitions. [2019-12-01 05:36:52,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-12-01 05:36:52,710 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:52,746 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-01 05:36:53,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:53,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 1800 states and 2267 transitions. [2019-12-01 05:36:53,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2267 transitions. [2019-12-01 05:36:53,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-12-01 05:36:53,990 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:54,060 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-12-01 05:36:59,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:36:59,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 1827 states and 2295 transitions. [2019-12-01 05:36:59,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2295 transitions. [2019-12-01 05:36:59,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-12-01 05:36:59,149 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:36:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:36:59,285 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-12-01 05:37:02,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:37:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 1835 states and 2312 transitions. [2019-12-01 05:37:02,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2312 transitions. [2019-12-01 05:37:02,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-12-01 05:37:02,015 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:37:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:37:02,193 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-12-01 05:37:03,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:37:03,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 1837 states and 2314 transitions. [2019-12-01 05:37:03,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2314 transitions. [2019-12-01 05:37:03,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-12-01 05:37:03,909 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:37:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:37:04,009 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-01 05:37:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:37:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 1845 states and 2323 transitions. [2019-12-01 05:37:07,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2323 transitions. [2019-12-01 05:37:07,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-12-01 05:37:07,794 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:37:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:37:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-12-01 05:37:11,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:37:11,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2334 states to 1855 states and 2334 transitions. [2019-12-01 05:37:11,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 2334 transitions. [2019-12-01 05:37:11,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-12-01 05:37:11,346 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:37:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:37:11,399 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 193 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-12-01 05:37:12,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:37:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2340 states to 1860 states and 2340 transitions. [2019-12-01 05:37:12,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 2340 transitions. [2019-12-01 05:37:12,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-12-01 05:37:12,137 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:37:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:37:15,380 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-01 05:37:24,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:37:24,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 1897 states and 2380 transitions. [2019-12-01 05:37:24,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2380 transitions. [2019-12-01 05:37:24,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-12-01 05:37:24,678 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:37:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:37:24,815 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-01 05:37:27,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:37:27,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 1909 states and 2391 transitions. [2019-12-01 05:37:27,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1909 states and 2391 transitions. [2019-12-01 05:37:27,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-12-01 05:37:27,245 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:37:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:37:27,437 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-01 05:37:28,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:37:28,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 1914 states and 2396 transitions. [2019-12-01 05:37:28,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2396 transitions. [2019-12-01 05:37:28,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-12-01 05:37:28,528 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:37:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:37:28,575 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-01 05:37:29,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:37:29,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 1919 states and 2400 transitions. [2019-12-01 05:37:29,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 2400 transitions. [2019-12-01 05:37:29,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-12-01 05:37:29,058 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:37:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:37:29,099 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-12-01 05:37:31,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:37:31,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 1947 states and 2432 transitions. [2019-12-01 05:37:31,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 2432 transitions. [2019-12-01 05:37:31,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-12-01 05:37:31,686 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:37:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:37:31,729 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-01 05:37:34,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:37:34,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2439 states to 1952 states and 2439 transitions. [2019-12-01 05:37:34,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 2439 transitions. [2019-12-01 05:37:34,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-12-01 05:37:34,379 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:37:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:37:35,220 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 170 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 05:37:41,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:37:41,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2501 states to 2006 states and 2501 transitions. [2019-12-01 05:37:41,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 2501 transitions. [2019-12-01 05:37:41,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-12-01 05:37:41,156 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:37:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:37:41,197 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-01 05:37:44,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:37:44,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2018 states and 2521 transitions. [2019-12-01 05:37:44,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 2521 transitions. [2019-12-01 05:37:44,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-12-01 05:37:44,400 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:37:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:37:44,449 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-01 05:37:49,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:37:49,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2033 states and 2536 transitions. [2019-12-01 05:37:49,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 2536 transitions. [2019-12-01 05:37:49,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-12-01 05:37:49,233 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:37:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:37:49,276 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-01 05:37:50,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:37:50,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2040 states and 2542 transitions. [2019-12-01 05:37:50,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 2542 transitions. [2019-12-01 05:37:50,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-12-01 05:37:50,820 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:37:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:37:53,553 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 05:37:56,088 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-12-01 05:38:09,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:38:09,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2592 states to 2085 states and 2592 transitions. [2019-12-01 05:38:09,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 2592 transitions. [2019-12-01 05:38:09,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-12-01 05:38:09,631 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:38:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:38:09,953 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 05:38:13,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:38:13,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2600 states to 2095 states and 2600 transitions. [2019-12-01 05:38:13,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 2600 transitions. [2019-12-01 05:38:13,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-12-01 05:38:13,726 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:38:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:38:14,034 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-01 05:38:14,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:38:14,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2100 states and 2605 transitions. [2019-12-01 05:38:14,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2605 transitions. [2019-12-01 05:38:14,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-12-01 05:38:14,602 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:38:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:38:14,648 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-12-01 05:38:20,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:38:20,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2125 states and 2636 transitions. [2019-12-01 05:38:20,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 2636 transitions. [2019-12-01 05:38:20,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-12-01 05:38:20,730 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:38:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:38:21,252 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-01 05:38:33,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:38:33,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2711 states to 2195 states and 2711 transitions. [2019-12-01 05:38:33,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 2711 transitions. [2019-12-01 05:38:33,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-12-01 05:38:33,099 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:38:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:38:37,005 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-01 05:38:41,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:38:41,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2205 states and 2722 transitions. [2019-12-01 05:38:41,892 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 2722 transitions. [2019-12-01 05:38:41,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-12-01 05:38:41,893 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:38:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:38:42,360 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-01 05:38:43,752 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-12-01 05:38:45,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:38:45,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2208 states and 2726 transitions. [2019-12-01 05:38:45,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 2726 transitions. [2019-12-01 05:38:45,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-12-01 05:38:45,377 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:38:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:38:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 116 proven. 4 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-12-01 05:38:47,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:38:47,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2209 states and 2730 transitions. [2019-12-01 05:38:47,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 2730 transitions. [2019-12-01 05:38:47,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-12-01 05:38:47,628 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:38:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:38:52,246 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-01 05:38:55,266 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2019-12-01 05:38:56,034 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-12-01 05:38:57,595 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-12-01 05:38:59,914 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2019-12-01 05:39:04,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:39:04,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2237 states and 2763 transitions. [2019-12-01 05:39:04,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 2763 transitions. [2019-12-01 05:39:04,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-12-01 05:39:04,248 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:39:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:39:04,467 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-01 05:39:07,169 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-12-01 05:39:08,999 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-12-01 05:39:09,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:39:09,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2245 states and 2770 transitions. [2019-12-01 05:39:09,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 2770 transitions. [2019-12-01 05:39:09,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-12-01 05:39:09,899 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:39:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:39:10,057 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-01 05:39:11,266 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2019-12-01 05:39:13,510 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2019-12-01 05:39:15,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:39:15,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2263 states and 2789 transitions. [2019-12-01 05:39:15,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 2789 transitions. [2019-12-01 05:39:15,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-12-01 05:39:15,422 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:39:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:39:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-01 05:39:16,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:39:16,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2264 states and 2790 transitions. [2019-12-01 05:39:16,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 2790 transitions. [2019-12-01 05:39:16,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-12-01 05:39:16,615 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:39:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:39:16,829 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-01 05:39:19,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:39:19,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2795 states to 2270 states and 2795 transitions. [2019-12-01 05:39:19,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 2795 transitions. [2019-12-01 05:39:19,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-12-01 05:39:19,310 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:39:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:39:19,467 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-01 05:39:19,940 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-12-01 05:39:21,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:39:21,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2276 states and 2799 transitions. [2019-12-01 05:39:21,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 2799 transitions. [2019-12-01 05:39:21,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-12-01 05:39:21,648 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:39:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:39:21,761 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-12-01 05:39:30,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:39:30,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2304 states and 2839 transitions. [2019-12-01 05:39:30,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 2839 transitions. [2019-12-01 05:39:30,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-12-01 05:39:30,164 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:39:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:39:30,230 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-12-01 05:39:32,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:39:32,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2842 states to 2309 states and 2842 transitions. [2019-12-01 05:39:32,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 2842 transitions. [2019-12-01 05:39:32,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-12-01 05:39:32,191 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:39:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:39:32,250 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-12-01 05:39:34,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:39:34,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2843 states to 2311 states and 2843 transitions. [2019-12-01 05:39:34,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 2843 transitions. [2019-12-01 05:39:34,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-12-01 05:39:34,820 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:39:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:39:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-12-01 05:39:34,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:39:34,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2849 states to 2317 states and 2849 transitions. [2019-12-01 05:39:34,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 2849 transitions. [2019-12-01 05:39:34,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-12-01 05:39:34,947 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:39:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:39:35,008 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-12-01 05:39:37,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:39:37,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2320 states and 2851 transitions. [2019-12-01 05:39:37,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 2851 transitions. [2019-12-01 05:39:37,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-12-01 05:39:37,724 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:39:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:39:37,796 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-12-01 05:39:44,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:39:44,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2360 states and 2890 transitions. [2019-12-01 05:39:44,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 2890 transitions. [2019-12-01 05:39:44,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-12-01 05:39:44,850 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:39:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:39:44,923 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-12-01 05:39:51,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:39:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2384 states and 2922 transitions. [2019-12-01 05:39:51,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2384 states and 2922 transitions. [2019-12-01 05:39:51,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-12-01 05:39:51,964 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:39:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:39:52,043 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-12-01 05:39:57,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:39:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2938 states to 2398 states and 2938 transitions. [2019-12-01 05:39:57,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 2938 transitions. [2019-12-01 05:39:57,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-12-01 05:39:57,636 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:39:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:39:57,706 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-12-01 05:40:00,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:40:00,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2405 states and 2945 transitions. [2019-12-01 05:40:00,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 2945 transitions. [2019-12-01 05:40:00,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-12-01 05:40:00,814 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:40:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:40:00,956 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-12-01 05:40:05,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:40:05,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2957 states to 2416 states and 2957 transitions. [2019-12-01 05:40:05,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 2957 transitions. [2019-12-01 05:40:05,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-12-01 05:40:05,352 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:40:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:40:05,422 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-12-01 05:40:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:40:06,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2960 states to 2419 states and 2960 transitions. [2019-12-01 05:40:06,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 2960 transitions. [2019-12-01 05:40:06,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-12-01 05:40:06,898 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:40:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:40:06,968 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-12-01 05:40:07,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:40:07,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2961 states to 2421 states and 2961 transitions. [2019-12-01 05:40:07,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 2961 transitions. [2019-12-01 05:40:07,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-12-01 05:40:07,811 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:40:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:40:07,881 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-12-01 05:40:08,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:40:08,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2963 states to 2424 states and 2963 transitions. [2019-12-01 05:40:08,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 2963 transitions. [2019-12-01 05:40:08,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-12-01 05:40:08,534 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:40:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:40:08,605 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-12-01 05:40:10,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:40:10,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2978 states to 2437 states and 2978 transitions. [2019-12-01 05:40:10,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 2978 transitions. [2019-12-01 05:40:10,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-12-01 05:40:10,217 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:40:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:40:10,287 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-12-01 05:40:11,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:40:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2979 states to 2439 states and 2979 transitions. [2019-12-01 05:40:11,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2439 states and 2979 transitions. [2019-12-01 05:40:11,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-12-01 05:40:11,183 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:40:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:40:11,286 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-01 05:40:12,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:40:12,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2443 states and 2984 transitions. [2019-12-01 05:40:12,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 2984 transitions. [2019-12-01 05:40:12,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-12-01 05:40:12,399 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:40:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:40:13,154 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 278 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-12-01 05:40:19,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:40:19,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3006 states to 2454 states and 3006 transitions. [2019-12-01 05:40:19,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2454 states and 3006 transitions. [2019-12-01 05:40:19,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-12-01 05:40:19,500 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:40:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:40:19,669 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 250 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-12-01 05:40:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:40:20,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 2457 states and 3012 transitions. [2019-12-01 05:40:20,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3012 transitions. [2019-12-01 05:40:20,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-12-01 05:40:20,532 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:40:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:40:20,640 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 250 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-12-01 05:40:21,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:40:21,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 2458 states and 3012 transitions. [2019-12-01 05:40:21,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2458 states and 3012 transitions. [2019-12-01 05:40:21,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-12-01 05:40:21,288 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:40:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:40:21,396 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 250 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-12-01 05:40:22,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:40:22,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 2460 states and 3016 transitions. [2019-12-01 05:40:22,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 3016 transitions. [2019-12-01 05:40:22,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-12-01 05:40:22,395 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:40:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:40:22,502 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 250 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-12-01 05:40:22,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:40:22,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 2461 states and 3016 transitions. [2019-12-01 05:40:22,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 3016 transitions. [2019-12-01 05:40:22,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-12-01 05:40:22,865 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:40:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:40:22,977 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-01 05:40:24,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:40:24,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3026 states to 2470 states and 3026 transitions. [2019-12-01 05:40:24,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 3026 transitions. [2019-12-01 05:40:24,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-12-01 05:40:24,080 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:40:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:40:24,434 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-01 05:40:25,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:40:25,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 2480 states and 3035 transitions. [2019-12-01 05:40:25,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 3035 transitions. [2019-12-01 05:40:25,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-12-01 05:40:25,017 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:40:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:40:28,898 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 71 proven. 187 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-12-01 05:40:36,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:40:36,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 2495 states and 3060 transitions. [2019-12-01 05:40:36,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 3060 transitions. [2019-12-01 05:40:36,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-12-01 05:40:36,664 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:40:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:40:36,734 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-01 05:40:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:40:42,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 2524 states and 3096 transitions. [2019-12-01 05:40:42,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2524 states and 3096 transitions. [2019-12-01 05:40:42,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-12-01 05:40:42,784 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:40:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:40:42,854 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-01 05:40:43,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:40:43,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3105 states to 2536 states and 3105 transitions. [2019-12-01 05:40:43,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 3105 transitions. [2019-12-01 05:40:43,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-12-01 05:40:43,633 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:40:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:40:43,703 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-01 05:40:44,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:40:44,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3105 states to 2537 states and 3105 transitions. [2019-12-01 05:40:44,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 3105 transitions. [2019-12-01 05:40:44,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-12-01 05:40:44,185 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:40:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:40:47,215 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-12-01 05:41:11,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:41:11,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3174 states to 2580 states and 3174 transitions. [2019-12-01 05:41:11,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 3174 transitions. [2019-12-01 05:41:11,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-12-01 05:41:11,567 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:41:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:41:11,683 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-12-01 05:41:22,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:41:22,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3202 states to 2603 states and 3202 transitions. [2019-12-01 05:41:22,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2603 states and 3202 transitions. [2019-12-01 05:41:22,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-12-01 05:41:22,077 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:41:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:41:22,200 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-12-01 05:41:23,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:41:23,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3202 states to 2604 states and 3202 transitions. [2019-12-01 05:41:23,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2604 states and 3202 transitions. [2019-12-01 05:41:23,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-12-01 05:41:23,117 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:41:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:41:23,248 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-12-01 05:41:31,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:41:31,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3281 states to 2655 states and 3281 transitions. [2019-12-01 05:41:31,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 3281 transitions. [2019-12-01 05:41:31,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-12-01 05:41:31,246 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:41:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:41:31,374 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-12-01 05:41:39,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:41:39,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3299 states to 2672 states and 3299 transitions. [2019-12-01 05:41:39,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2672 states and 3299 transitions. [2019-12-01 05:41:39,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-12-01 05:41:39,460 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:41:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:41:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-12-01 05:41:41,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:41:41,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3303 states to 2676 states and 3303 transitions. [2019-12-01 05:41:41,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 3303 transitions. [2019-12-01 05:41:41,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-12-01 05:41:41,209 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:41:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:41:41,338 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-12-01 05:41:42,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:41:42,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3309 states to 2680 states and 3309 transitions. [2019-12-01 05:41:42,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2680 states and 3309 transitions. [2019-12-01 05:41:42,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-12-01 05:41:42,901 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:41:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:41:43,030 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-12-01 05:41:47,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:41:47,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3343 states to 2705 states and 3343 transitions. [2019-12-01 05:41:47,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 3343 transitions. [2019-12-01 05:41:47,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-12-01 05:41:47,820 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:41:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:41:47,951 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-12-01 05:41:48,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:41:48,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 2720 states and 3357 transitions. [2019-12-01 05:41:48,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2720 states and 3357 transitions. [2019-12-01 05:41:48,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-12-01 05:41:48,095 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:41:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:41:48,226 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-12-01 05:41:49,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:41:49,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3364 states to 2723 states and 3364 transitions. [2019-12-01 05:41:49,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3364 transitions. [2019-12-01 05:41:49,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-12-01 05:41:49,060 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:41:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:41:49,188 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-12-01 05:41:52,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:41:52,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3371 states to 2730 states and 3371 transitions. [2019-12-01 05:41:52,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2730 states and 3371 transitions. [2019-12-01 05:41:52,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-12-01 05:41:52,330 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:41:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:41:52,458 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-12-01 05:41:53,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:41:53,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3371 states to 2731 states and 3371 transitions. [2019-12-01 05:41:53,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2731 states and 3371 transitions. [2019-12-01 05:41:53,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-12-01 05:41:53,710 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:41:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:41:53,838 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-12-01 05:41:55,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:41:55,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3383 states to 2737 states and 3383 transitions. [2019-12-01 05:41:55,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2737 states and 3383 transitions. [2019-12-01 05:41:55,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-12-01 05:41:55,875 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:41:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:42:00,999 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-12-01 05:42:08,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:42:08,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3405 states to 2757 states and 3405 transitions. [2019-12-01 05:42:08,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2757 states and 3405 transitions. [2019-12-01 05:42:08,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-12-01 05:42:08,586 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:42:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:42:11,990 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 375 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-01 05:42:15,504 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-12-01 05:42:27,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:42:27,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3450 states to 2789 states and 3450 transitions. [2019-12-01 05:42:27,820 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 3450 transitions. [2019-12-01 05:42:27,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-12-01 05:42:27,821 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:42:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:42:27,911 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-01 05:42:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:42:30,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3464 states to 2804 states and 3464 transitions. [2019-12-01 05:42:30,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2804 states and 3464 transitions. [2019-12-01 05:42:30,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-12-01 05:42:30,928 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:42:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:42:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-01 05:42:34,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:42:34,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3475 states to 2814 states and 3475 transitions. [2019-12-01 05:42:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2814 states and 3475 transitions. [2019-12-01 05:42:34,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-12-01 05:42:34,024 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:42:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:42:34,116 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-01 05:42:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:42:39,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3500 states to 2839 states and 3500 transitions. [2019-12-01 05:42:39,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 3500 transitions. [2019-12-01 05:42:39,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-12-01 05:42:39,387 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:42:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:42:39,476 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-01 05:42:41,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:42:41,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3505 states to 2844 states and 3505 transitions. [2019-12-01 05:42:41,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2844 states and 3505 transitions. [2019-12-01 05:42:41,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-12-01 05:42:41,431 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:42:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:42:41,521 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-01 05:42:43,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:42:43,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3506 states to 2846 states and 3506 transitions. [2019-12-01 05:42:43,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 3506 transitions. [2019-12-01 05:42:43,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-12-01 05:42:43,333 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:42:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:42:43,423 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-01 05:42:47,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:42:47,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3518 states to 2858 states and 3518 transitions. [2019-12-01 05:42:47,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 3518 transitions. [2019-12-01 05:42:47,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-12-01 05:42:47,041 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:42:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:42:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-12-01 05:42:51,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:42:51,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3533 states to 2864 states and 3533 transitions. [2019-12-01 05:42:51,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2864 states and 3533 transitions. [2019-12-01 05:42:51,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-12-01 05:42:51,460 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:42:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:42:51,553 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-12-01 05:42:56,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:42:56,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3541 states to 2869 states and 3541 transitions. [2019-12-01 05:42:56,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2869 states and 3541 transitions. [2019-12-01 05:42:56,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-12-01 05:42:56,552 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:42:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:42:56,647 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-12-01 05:43:05,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:43:05,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3556 states to 2882 states and 3556 transitions. [2019-12-01 05:43:05,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2882 states and 3556 transitions. [2019-12-01 05:43:05,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-12-01 05:43:05,301 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:43:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:43:05,394 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-12-01 05:43:09,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:43:09,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 2906 states and 3580 transitions. [2019-12-01 05:43:09,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2906 states and 3580 transitions. [2019-12-01 05:43:09,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-12-01 05:43:09,970 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:43:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:43:10,063 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-12-01 05:43:12,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:43:12,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 2908 states and 3580 transitions. [2019-12-01 05:43:12,764 INFO L276 IsEmpty]: Start isEmpty. Operand 2908 states and 3580 transitions. [2019-12-01 05:43:12,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-12-01 05:43:12,766 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:43:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:43:12,856 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-12-01 05:43:14,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:43:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3587 states to 2915 states and 3587 transitions. [2019-12-01 05:43:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 3587 transitions. [2019-12-01 05:43:14,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-12-01 05:43:14,462 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:43:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:43:14,633 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-12-01 05:43:15,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:43:15,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3587 states to 2916 states and 3587 transitions. [2019-12-01 05:43:15,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 3587 transitions. [2019-12-01 05:43:15,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-12-01 05:43:15,482 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:43:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:43:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-12-01 05:43:19,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:43:19,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3597 states to 2926 states and 3597 transitions. [2019-12-01 05:43:19,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 3597 transitions. [2019-12-01 05:43:19,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-12-01 05:43:19,438 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:43:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:43:19,529 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-12-01 05:43:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:43:21,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3603 states to 2933 states and 3603 transitions. [2019-12-01 05:43:21,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2933 states and 3603 transitions. [2019-12-01 05:43:21,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-12-01 05:43:21,269 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:43:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:43:21,487 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 192 proven. 8 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-12-01 05:43:40,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:43:40,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3673 states to 2992 states and 3673 transitions. [2019-12-01 05:43:40,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2992 states and 3673 transitions. [2019-12-01 05:43:40,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-12-01 05:43:40,718 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:43:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:43:40,862 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 192 proven. 8 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-12-01 05:43:47,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:43:47,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3718 states to 3031 states and 3718 transitions. [2019-12-01 05:43:47,010 INFO L276 IsEmpty]: Start isEmpty. Operand 3031 states and 3718 transitions. [2019-12-01 05:43:47,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-12-01 05:43:47,012 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:43:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:43:47,156 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 192 proven. 8 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-12-01 05:43:51,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:43:51,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3725 states to 3040 states and 3725 transitions. [2019-12-01 05:43:51,832 INFO L276 IsEmpty]: Start isEmpty. Operand 3040 states and 3725 transitions. [2019-12-01 05:43:51,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-12-01 05:43:51,833 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:43:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:43:51,977 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 192 proven. 8 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-12-01 05:43:52,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:43:52,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3729 states to 3044 states and 3729 transitions. [2019-12-01 05:43:52,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3044 states and 3729 transitions. [2019-12-01 05:43:52,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-12-01 05:43:52,986 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:43:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 05:43:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 192 proven. 8 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-12-01 05:43:54,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 05:43:54,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3048 states and 3733 transitions. [2019-12-01 05:43:54,282 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 3733 transitions. [2019-12-01 05:43:54,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-12-01 05:43:54,284 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 05:43:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 05:43:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 05:43:54,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 05:43:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 05:43:54,558 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 253 iterations. [2019-12-01 05:43:54,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 05:43:54 ImpRootNode [2019-12-01 05:43:54,705 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-12-01 05:43:54,705 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-01 05:43:54,705 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-01 05:43:54,705 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-01 05:43:54,706 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:33:29" (3/4) ... [2019-12-01 05:43:54,707 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-01 05:43:54,806 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_796b0df3-4013-4a24-9c97-bc8d55eecc5a/bin/ukojak/witness.graphml [2019-12-01 05:43:54,806 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-01 05:43:54,807 INFO L168 Benchmark]: Toolchain (without parser) took 627148.40 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 935.5 MB in the beginning and 310.1 MB in the end (delta: 625.3 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-12-01 05:43:54,807 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-01 05:43:54,807 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.6 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -128.7 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-12-01 05:43:54,807 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-01 05:43:54,808 INFO L168 Benchmark]: Boogie Preprocessor took 39.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-12-01 05:43:54,808 INFO L168 Benchmark]: RCFGBuilder took 1078.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 839.5 MB in the end (delta: 212.8 MB). Peak memory consumption was 212.8 MB. Max. memory is 11.5 GB. [2019-12-01 05:43:54,808 INFO L168 Benchmark]: CodeCheck took 625504.46 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 839.5 MB in the beginning and 346.2 MB in the end (delta: 493.4 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-12-01 05:43:54,808 INFO L168 Benchmark]: Witness Printer took 100.79 ms. Allocated memory is still 2.4 GB. Free memory was 346.2 MB in the beginning and 310.1 MB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. [2019-12-01 05:43:54,810 INFO L335 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, 76 locations, 1 error locations. Result: UNSAFE, OverallTime: 625.3s, OverallIterations: 253, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: -515866420 SDtfs, -1631259420 SDslu, 1199817992 SDs, 0 SdLazy, 1749553208 SolverSat, -668975000 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1765.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 274213 GetRequests, 265735 SyntacticMatches, 5776 SemanticMatches, 2702 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5250801 ImplicationChecksByTransitivity, 580.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 1.0s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 45.1s InterpolantComputationTime, 40719 NumberOfCodeBlocks, 40719 NumberOfCodeBlocksAsserted, 253 NumberOfCheckSat, 40205 ConstructedInterpolants, 0 QuantifiedInterpolants, 27920776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 252 InterpolantComputations, 209 PerfectInterpolantSequences, 36991/37442 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 395]: 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 FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] 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=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND TRUE ((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1))) [L149] a16 = 4 [L150] a17 = 0 [L151] return 25; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] 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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND 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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [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=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND TRUE ((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1))) [L232] a8 = 14 [L233] a7 = 0 [L234] a17 = 1 [L235] a21 = 1 [L236] a16 = 4 [L237] return -1; VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] 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=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND TRUE (((((((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=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L395] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 373.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.6 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -128.7 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1078.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 839.5 MB in the end (delta: 212.8 MB). Peak memory consumption was 212.8 MB. Max. memory is 11.5 GB. * CodeCheck took 625504.46 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 839.5 MB in the beginning and 346.2 MB in the end (delta: 493.4 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 100.79 ms. Allocated memory is still 2.4 GB. Free memory was 346.2 MB in the beginning and 310.1 MB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...