./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label33_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f973a999-a50b-4ddf-8664-1f5977786d0a/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f973a999-a50b-4ddf-8664-1f5977786d0a/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f973a999-a50b-4ddf-8664-1f5977786d0a/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f973a999-a50b-4ddf-8664-1f5977786d0a/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label33_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f973a999-a50b-4ddf-8664-1f5977786d0a/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f973a999-a50b-4ddf-8664-1f5977786d0a/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a503fea819b7f7110cbbc6f7f69d6be84492b6b4 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:44:38,658 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:44:38,659 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:44:38,666 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:44:38,667 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:44:38,667 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:44:38,668 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:44:38,668 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:44:38,669 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:44:38,670 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:44:38,670 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:44:38,670 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:44:38,671 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:44:38,671 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:44:38,672 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:44:38,672 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:44:38,672 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:44:38,673 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:44:38,674 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:44:38,675 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:44:38,676 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:44:38,677 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:44:38,679 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:44:38,679 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:44:38,679 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:44:38,680 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:44:38,680 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:44:38,681 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:44:38,682 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:44:38,682 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:44:38,682 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:44:38,683 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:44:38,683 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:44:38,683 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:44:38,684 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:44:38,684 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:44:38,685 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f973a999-a50b-4ddf-8664-1f5977786d0a/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 12:44:38,695 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:44:38,695 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:44:38,695 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:44:38,695 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 12:44:38,696 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:44:38,696 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:44:38,696 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:44:38,696 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:44:38,697 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:44:38,697 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:44:38,697 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:44:38,697 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:44:38,697 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:44:38,697 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:44:38,697 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:44:38,697 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:44:38,697 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:44:38,697 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 12:44:38,698 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 12:44:38,698 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:44:38,698 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:44:38,698 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 12:44:38,698 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:44:38,698 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:44:38,698 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:44:38,698 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 12:44:38,698 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:44:38,698 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:44:38,698 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_f973a999-a50b-4ddf-8664-1f5977786d0a/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a503fea819b7f7110cbbc6f7f69d6be84492b6b4 [2018-11-10 12:44:38,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:44:38,730 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:44:38,732 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:44:38,733 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:44:38,733 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:44:38,734 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f973a999-a50b-4ddf-8664-1f5977786d0a/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label33_false-unreach-call_false-termination.c [2018-11-10 12:44:38,778 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f973a999-a50b-4ddf-8664-1f5977786d0a/bin-2019/ukojak/data/16b475d22/62da440bba1a4b24845f3a5bd4ff42d5/FLAGc843c7635 [2018-11-10 12:44:39,155 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:44:39,156 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f973a999-a50b-4ddf-8664-1f5977786d0a/sv-benchmarks/c/eca-rers2012/Problem01_label33_false-unreach-call_false-termination.c [2018-11-10 12:44:39,164 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f973a999-a50b-4ddf-8664-1f5977786d0a/bin-2019/ukojak/data/16b475d22/62da440bba1a4b24845f3a5bd4ff42d5/FLAGc843c7635 [2018-11-10 12:44:39,176 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f973a999-a50b-4ddf-8664-1f5977786d0a/bin-2019/ukojak/data/16b475d22/62da440bba1a4b24845f3a5bd4ff42d5 [2018-11-10 12:44:39,178 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:44:39,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:44:39,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:44:39,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:44:39,183 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:44:39,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:44:39" (1/1) ... [2018-11-10 12:44:39,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@769b41f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:39, skipping insertion in model container [2018-11-10 12:44:39,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:44:39" (1/1) ... [2018-11-10 12:44:39,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:44:39,229 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:44:39,442 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:44:39,445 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:44:39,513 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:44:39,525 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:44:39,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:39 WrapperNode [2018-11-10 12:44:39,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:44:39,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:44:39,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:44:39,526 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:44:39,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:39" (1/1) ... [2018-11-10 12:44:39,545 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:39" (1/1) ... [2018-11-10 12:44:39,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:44:39,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:44:39,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:44:39,633 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:44:39,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:39" (1/1) ... [2018-11-10 12:44:39,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:39" (1/1) ... [2018-11-10 12:44:39,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:39" (1/1) ... [2018-11-10 12:44:39,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:39" (1/1) ... [2018-11-10 12:44:39,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:39" (1/1) ... [2018-11-10 12:44:39,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:39" (1/1) ... [2018-11-10 12:44:39,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:39" (1/1) ... [2018-11-10 12:44:39,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:44:39,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:44:39,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:44:39,674 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:44:39,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f973a999-a50b-4ddf-8664-1f5977786d0a/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 12:44:39,725 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 12:44:39,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:44:39,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:44:40,924 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:44:40,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:44:40 BoogieIcfgContainer [2018-11-10 12:44:40,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:44:40,925 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 12:44:40,925 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 12:44:40,932 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 12:44:40,932 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:44:40" (1/1) ... [2018-11-10 12:44:40,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:44:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:40,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 77 states and 146 transitions. [2018-11-10 12:44:40,964 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 146 transitions. [2018-11-10 12:44:40,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 12:44:40,967 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:41,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:41,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 147 states and 239 transitions. [2018-11-10 12:44:41,548 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 239 transitions. [2018-11-10 12:44:41,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 12:44:41,550 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:41,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:44:41,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:41,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 148 states and 240 transitions. [2018-11-10 12:44:41,744 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 240 transitions. [2018-11-10 12:44:41,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 12:44:41,745 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:41,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:41,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:41,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 153 states and 248 transitions. [2018-11-10 12:44:41,856 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 248 transitions. [2018-11-10 12:44:41,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 12:44:41,858 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:41,924 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:42,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:42,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 162 states and 264 transitions. [2018-11-10 12:44:42,086 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 264 transitions. [2018-11-10 12:44:42,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 12:44:42,087 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:42,108 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:44:42,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 163 states and 265 transitions. [2018-11-10 12:44:42,217 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 265 transitions. [2018-11-10 12:44:42,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 12:44:42,218 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:42,278 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 12:44:42,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:42,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 176 states and 286 transitions. [2018-11-10 12:44:42,631 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 286 transitions. [2018-11-10 12:44:42,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 12:44:42,634 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:42,670 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:42,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:42,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 182 states and 293 transitions. [2018-11-10 12:44:42,751 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 293 transitions. [2018-11-10 12:44:42,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 12:44:42,752 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:42,774 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:42,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:42,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 183 states and 294 transitions. [2018-11-10 12:44:42,802 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 294 transitions. [2018-11-10 12:44:42,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 12:44:42,803 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:42,872 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:43,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:43,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 198 states and 314 transitions. [2018-11-10 12:44:43,257 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 314 transitions. [2018-11-10 12:44:43,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 12:44:43,258 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:43,292 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:43,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:43,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 199 states and 316 transitions. [2018-11-10 12:44:43,310 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 316 transitions. [2018-11-10 12:44:43,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 12:44:43,311 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:43,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:43,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 209 states and 335 transitions. [2018-11-10 12:44:43,662 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 335 transitions. [2018-11-10 12:44:43,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 12:44:43,663 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:43,686 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:43,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:43,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 210 states and 337 transitions. [2018-11-10 12:44:43,800 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 337 transitions. [2018-11-10 12:44:43,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 12:44:43,801 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:43,826 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:44:43,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:43,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 211 states and 338 transitions. [2018-11-10 12:44:43,858 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 338 transitions. [2018-11-10 12:44:43,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 12:44:43,859 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:43,881 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:43,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:43,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 214 states and 341 transitions. [2018-11-10 12:44:43,907 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 341 transitions. [2018-11-10 12:44:43,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 12:44:43,907 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:44,011 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:44,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:44,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 225 states and 359 transitions. [2018-11-10 12:44:44,590 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 359 transitions. [2018-11-10 12:44:44,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 12:44:44,591 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:44,612 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:44:44,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:44,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 227 states and 360 transitions. [2018-11-10 12:44:44,712 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 360 transitions. [2018-11-10 12:44:44,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 12:44:44,712 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 12:44:44,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:44,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 232 states and 365 transitions. [2018-11-10 12:44:44,947 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 365 transitions. [2018-11-10 12:44:44,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 12:44:44,948 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:45,006 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:45,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:45,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 238 states and 375 transitions. [2018-11-10 12:44:45,188 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 375 transitions. [2018-11-10 12:44:45,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-10 12:44:45,189 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:45,210 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:45,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:45,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 248 states and 389 transitions. [2018-11-10 12:44:45,672 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 389 transitions. [2018-11-10 12:44:45,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-10 12:44:45,672 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:45,693 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:45,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:45,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 249 states and 391 transitions. [2018-11-10 12:44:45,861 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 391 transitions. [2018-11-10 12:44:45,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 12:44:45,861 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 12:44:45,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:45,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 251 states and 392 transitions. [2018-11-10 12:44:45,959 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 392 transitions. [2018-11-10 12:44:45,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-10 12:44:45,959 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:46,026 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:46,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:46,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 276 states and 426 transitions. [2018-11-10 12:44:46,901 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 426 transitions. [2018-11-10 12:44:46,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-10 12:44:46,901 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:46,921 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:44:47,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:47,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 287 states and 440 transitions. [2018-11-10 12:44:47,363 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 440 transitions. [2018-11-10 12:44:47,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-10 12:44:47,364 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:47,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:47,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 290 states and 443 transitions. [2018-11-10 12:44:47,425 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 443 transitions. [2018-11-10 12:44:47,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 12:44:47,426 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 12:44:47,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:47,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 292 states and 448 transitions. [2018-11-10 12:44:47,577 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 448 transitions. [2018-11-10 12:44:47,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 12:44:47,578 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:47,655 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:48,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 306 states and 470 transitions. [2018-11-10 12:44:48,445 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 470 transitions. [2018-11-10 12:44:48,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 12:44:48,446 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:48,484 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:48,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 311 states and 477 transitions. [2018-11-10 12:44:48,716 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 477 transitions. [2018-11-10 12:44:48,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 12:44:48,717 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:48,733 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:49,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:49,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 326 states and 492 transitions. [2018-11-10 12:44:49,357 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 492 transitions. [2018-11-10 12:44:49,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 12:44:49,358 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:49,434 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:50,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:50,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 337 states and 504 transitions. [2018-11-10 12:44:50,014 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 504 transitions. [2018-11-10 12:44:50,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-10 12:44:50,015 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:50,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 339 states and 507 transitions. [2018-11-10 12:44:50,071 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 507 transitions. [2018-11-10 12:44:50,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 12:44:50,072 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:50,338 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:51,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:51,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 360 states and 541 transitions. [2018-11-10 12:44:51,525 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 541 transitions. [2018-11-10 12:44:51,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 12:44:51,525 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:51,644 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:52,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:52,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 371 states and 554 transitions. [2018-11-10 12:44:52,047 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 554 transitions. [2018-11-10 12:44:52,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 12:44:52,048 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:52,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:52,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 377 states and 560 transitions. [2018-11-10 12:44:52,343 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 560 transitions. [2018-11-10 12:44:52,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 12:44:52,343 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:52,410 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:52,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 378 states and 562 transitions. [2018-11-10 12:44:52,573 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 562 transitions. [2018-11-10 12:44:52,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 12:44:52,573 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:52,635 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:52,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:52,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 382 states and 568 transitions. [2018-11-10 12:44:52,801 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 568 transitions. [2018-11-10 12:44:52,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 12:44:52,802 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:52,898 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:53,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:53,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 383 states and 569 transitions. [2018-11-10 12:44:53,140 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 569 transitions. [2018-11-10 12:44:53,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 12:44:53,140 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:53,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:53,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 387 states and 573 transitions. [2018-11-10 12:44:53,401 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 573 transitions. [2018-11-10 12:44:53,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 12:44:53,401 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:53,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:53,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 388 states and 574 transitions. [2018-11-10 12:44:53,653 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 574 transitions. [2018-11-10 12:44:53,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 12:44:53,654 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:53,951 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:55,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:55,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 402 states and 595 transitions. [2018-11-10 12:44:55,070 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 595 transitions. [2018-11-10 12:44:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 12:44:55,070 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:55,095 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:44:55,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 413 states and 608 transitions. [2018-11-10 12:44:55,815 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 608 transitions. [2018-11-10 12:44:55,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 12:44:55,815 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 12:44:56,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:56,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 422 states and 618 transitions. [2018-11-10 12:44:56,403 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 618 transitions. [2018-11-10 12:44:56,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 12:44:56,404 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:56,426 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:57,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 439 states and 639 transitions. [2018-11-10 12:44:57,426 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 639 transitions. [2018-11-10 12:44:57,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 12:44:57,426 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:57,459 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:58,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:58,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 463 states and 673 transitions. [2018-11-10 12:44:58,724 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 673 transitions. [2018-11-10 12:44:58,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 12:44:58,724 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:58,757 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:58,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:58,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 471 states and 680 transitions. [2018-11-10 12:44:58,995 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 680 transitions. [2018-11-10 12:44:58,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 12:44:58,996 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:59,016 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:59,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:59,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 476 states and 684 transitions. [2018-11-10 12:44:59,287 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 684 transitions. [2018-11-10 12:44:59,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 12:44:59,288 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:59,315 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:44:59,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:44:59,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 547 states and 764 transitions. [2018-11-10 12:44:59,712 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 764 transitions. [2018-11-10 12:44:59,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-10 12:44:59,712 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:44:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:44:59,840 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:45:00,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:00,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 556 states and 772 transitions. [2018-11-10 12:45:00,507 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 772 transitions. [2018-11-10 12:45:00,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 12:45:00,507 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:00,524 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:45:00,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:00,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 565 states and 783 transitions. [2018-11-10 12:45:00,553 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 783 transitions. [2018-11-10 12:45:00,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 12:45:00,554 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:45:01,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:01,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 585 states and 807 transitions. [2018-11-10 12:45:01,762 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 807 transitions. [2018-11-10 12:45:01,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 12:45:01,762 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:01,777 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:45:01,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:01,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 586 states and 807 transitions. [2018-11-10 12:45:01,872 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 807 transitions. [2018-11-10 12:45:01,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-10 12:45:01,873 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:01,911 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:45:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 599 states and 822 transitions. [2018-11-10 12:45:02,137 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 822 transitions. [2018-11-10 12:45:02,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 12:45:02,137 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:02,153 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 12:45:02,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:02,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 601 states and 823 transitions. [2018-11-10 12:45:02,242 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 823 transitions. [2018-11-10 12:45:02,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 12:45:02,243 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:02,259 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:45:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:02,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 605 states and 826 transitions. [2018-11-10 12:45:02,396 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 826 transitions. [2018-11-10 12:45:02,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 12:45:02,396 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:02,494 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:45:02,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:02,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 619 states and 842 transitions. [2018-11-10 12:45:02,691 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 842 transitions. [2018-11-10 12:45:02,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 12:45:02,692 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:02,720 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 12:45:02,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:02,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 621 states and 843 transitions. [2018-11-10 12:45:02,836 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 843 transitions. [2018-11-10 12:45:02,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 12:45:02,837 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:02,880 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 12:45:02,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 623 states and 846 transitions. [2018-11-10 12:45:02,918 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 846 transitions. [2018-11-10 12:45:02,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 12:45:02,918 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:03,209 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:45:04,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:04,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 668 states and 894 transitions. [2018-11-10 12:45:04,975 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 894 transitions. [2018-11-10 12:45:04,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 12:45:04,976 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:05,003 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 12:45:05,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:05,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 744 states and 973 transitions. [2018-11-10 12:45:05,590 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 973 transitions. [2018-11-10 12:45:05,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 12:45:05,590 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:05,609 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 12:45:05,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:05,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 749 states and 980 transitions. [2018-11-10 12:45:05,836 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 980 transitions. [2018-11-10 12:45:05,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 12:45:05,836 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:05,854 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 12:45:06,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:06,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 754 states and 984 transitions. [2018-11-10 12:45:06,185 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 984 transitions. [2018-11-10 12:45:06,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 12:45:06,186 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:06,215 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 12:45:06,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:06,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 756 states and 985 transitions. [2018-11-10 12:45:06,364 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 985 transitions. [2018-11-10 12:45:06,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 12:45:06,365 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:06,401 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 12:45:06,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:06,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 759 states and 988 transitions. [2018-11-10 12:45:06,546 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 988 transitions. [2018-11-10 12:45:06,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-10 12:45:06,547 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 12:45:07,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:07,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 771 states and 1005 transitions. [2018-11-10 12:45:07,117 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1005 transitions. [2018-11-10 12:45:07,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-10 12:45:07,117 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:07,287 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 12:45:08,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 787 states and 1032 transitions. [2018-11-10 12:45:08,371 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1032 transitions. [2018-11-10 12:45:08,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-10 12:45:08,372 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:08,789 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 97 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:45:09,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:09,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 818 states and 1067 transitions. [2018-11-10 12:45:09,637 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1067 transitions. [2018-11-10 12:45:09,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-10 12:45:09,638 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:10,026 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:45:11,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:11,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 843 states and 1094 transitions. [2018-11-10 12:45:11,053 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1094 transitions. [2018-11-10 12:45:11,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-10 12:45:11,054 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:11,072 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 12:45:11,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:11,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 845 states and 1097 transitions. [2018-11-10 12:45:11,263 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1097 transitions. [2018-11-10 12:45:11,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-10 12:45:11,263 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:11,298 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 12:45:13,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:13,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 880 states and 1144 transitions. [2018-11-10 12:45:13,361 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1144 transitions. [2018-11-10 12:45:13,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-10 12:45:13,362 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:13,392 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 12:45:13,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:13,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 885 states and 1148 transitions. [2018-11-10 12:45:13,848 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1148 transitions. [2018-11-10 12:45:13,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-10 12:45:13,849 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 12:45:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:14,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 893 states and 1155 transitions. [2018-11-10 12:45:14,349 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1155 transitions. [2018-11-10 12:45:14,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 12:45:14,350 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:14,397 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 12:45:14,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:14,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 894 states and 1155 transitions. [2018-11-10 12:45:14,422 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1155 transitions. [2018-11-10 12:45:14,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-10 12:45:14,422 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:14,443 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 12:45:14,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:14,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 901 states and 1163 transitions. [2018-11-10 12:45:14,677 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1163 transitions. [2018-11-10 12:45:14,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-10 12:45:14,678 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:14,702 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 12:45:15,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:15,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 906 states and 1170 transitions. [2018-11-10 12:45:15,317 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1170 transitions. [2018-11-10 12:45:15,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 12:45:15,318 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:15,811 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:45:18,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:18,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 976 states and 1244 transitions. [2018-11-10 12:45:18,559 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1244 transitions. [2018-11-10 12:45:18,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 12:45:18,560 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:18,604 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:45:20,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:20,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1017 states and 1291 transitions. [2018-11-10 12:45:20,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1291 transitions. [2018-11-10 12:45:20,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 12:45:20,291 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:20,335 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:45:21,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:21,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1024 states and 1298 transitions. [2018-11-10 12:45:21,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1298 transitions. [2018-11-10 12:45:21,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 12:45:21,146 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:45:21,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:21,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1028 states and 1303 transitions. [2018-11-10 12:45:21,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1303 transitions. [2018-11-10 12:45:21,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 12:45:21,843 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:21,890 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:45:22,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:22,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1032 states and 1306 transitions. [2018-11-10 12:45:22,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1306 transitions. [2018-11-10 12:45:22,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 12:45:22,185 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:22,210 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:45:22,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:22,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1043 states and 1318 transitions. [2018-11-10 12:45:22,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1318 transitions. [2018-11-10 12:45:22,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-10 12:45:22,397 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:22,429 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 12:45:22,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:22,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1045 states and 1320 transitions. [2018-11-10 12:45:22,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1320 transitions. [2018-11-10 12:45:22,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 12:45:22,457 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:22,522 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 12:45:22,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1047 states and 1324 transitions. [2018-11-10 12:45:22,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1324 transitions. [2018-11-10 12:45:22,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 12:45:22,561 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:22,627 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 12:45:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:22,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1052 states and 1329 transitions. [2018-11-10 12:45:22,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1329 transitions. [2018-11-10 12:45:22,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 12:45:22,778 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 12:45:23,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:23,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1068 states and 1345 transitions. [2018-11-10 12:45:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1345 transitions. [2018-11-10 12:45:23,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 12:45:23,337 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:23,393 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 96 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 12:45:23,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:23,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1069 states and 1345 transitions. [2018-11-10 12:45:23,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1345 transitions. [2018-11-10 12:45:23,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 12:45:23,671 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:23,713 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 12:45:24,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:24,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1087 states and 1375 transitions. [2018-11-10 12:45:24,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1375 transitions. [2018-11-10 12:45:24,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 12:45:24,695 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:24,747 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 12:45:25,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1092 states and 1381 transitions. [2018-11-10 12:45:25,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1381 transitions. [2018-11-10 12:45:25,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 12:45:25,039 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:25,080 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 12:45:25,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:25,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1093 states and 1384 transitions. [2018-11-10 12:45:25,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1384 transitions. [2018-11-10 12:45:25,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-10 12:45:25,356 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:25,385 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 12:45:25,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:25,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1100 states and 1391 transitions. [2018-11-10 12:45:25,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1391 transitions. [2018-11-10 12:45:25,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 12:45:25,415 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:26,046 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 179 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:45:28,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:28,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1135 states and 1431 transitions. [2018-11-10 12:45:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1431 transitions. [2018-11-10 12:45:28,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 12:45:28,230 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:28,924 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 165 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 12:45:29,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:29,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1160 states and 1458 transitions. [2018-11-10 12:45:29,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1458 transitions. [2018-11-10 12:45:29,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 12:45:29,864 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:30,027 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 160 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:45:30,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:30,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1188 states and 1489 transitions. [2018-11-10 12:45:30,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1489 transitions. [2018-11-10 12:45:30,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 12:45:30,727 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:30,922 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 118 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:45:32,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:32,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1223 states and 1530 transitions. [2018-11-10 12:45:32,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1530 transitions. [2018-11-10 12:45:32,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 12:45:32,250 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:32,352 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 118 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:45:32,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:32,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1231 states and 1539 transitions. [2018-11-10 12:45:32,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1539 transitions. [2018-11-10 12:45:32,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 12:45:32,994 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:33,050 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 12:45:33,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:33,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1241 states and 1548 transitions. [2018-11-10 12:45:33,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1548 transitions. [2018-11-10 12:45:33,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 12:45:33,695 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 112 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:45:35,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:35,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1281 states and 1591 transitions. [2018-11-10 12:45:35,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1591 transitions. [2018-11-10 12:45:35,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-10 12:45:35,635 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:36,691 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 12:45:38,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:38,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1329 states and 1639 transitions. [2018-11-10 12:45:38,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1639 transitions. [2018-11-10 12:45:38,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 12:45:38,775 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:38,820 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 127 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-10 12:45:40,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:40,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1396 states and 1715 transitions. [2018-11-10 12:45:40,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1715 transitions. [2018-11-10 12:45:40,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 12:45:40,735 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:40,774 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 127 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-10 12:45:41,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:41,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1402 states and 1721 transitions. [2018-11-10 12:45:41,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1721 transitions. [2018-11-10 12:45:41,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-10 12:45:41,354 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:41,386 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-10 12:45:41,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:41,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1427 states and 1748 transitions. [2018-11-10 12:45:41,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1748 transitions. [2018-11-10 12:45:41,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-10 12:45:41,669 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:41,797 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 112 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-10 12:45:41,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:41,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1434 states and 1756 transitions. [2018-11-10 12:45:41,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1756 transitions. [2018-11-10 12:45:41,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-10 12:45:41,981 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:42,017 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 12:45:42,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:42,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1437 states and 1760 transitions. [2018-11-10 12:45:42,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1760 transitions. [2018-11-10 12:45:42,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-10 12:45:42,501 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:42,537 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 12:45:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1443 states and 1767 transitions. [2018-11-10 12:45:43,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1767 transitions. [2018-11-10 12:45:43,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-10 12:45:43,091 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:43,139 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 12:45:43,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:43,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1464 states and 1787 transitions. [2018-11-10 12:45:43,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 1787 transitions. [2018-11-10 12:45:43,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-10 12:45:43,205 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:43,239 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 12:45:43,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:43,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1469 states and 1791 transitions. [2018-11-10 12:45:43,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 1791 transitions. [2018-11-10 12:45:43,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-10 12:45:43,418 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:43,609 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 245 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-10 12:45:44,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:44,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1479 states and 1805 transitions. [2018-11-10 12:45:44,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 1805 transitions. [2018-11-10 12:45:44,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-10 12:45:44,157 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:45,457 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 12:45:48,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:48,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1544 states and 1873 transitions. [2018-11-10 12:45:48,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1873 transitions. [2018-11-10 12:45:48,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-10 12:45:48,307 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:48,338 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 12:45:48,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:48,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1549 states and 1878 transitions. [2018-11-10 12:45:48,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 1878 transitions. [2018-11-10 12:45:48,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-10 12:45:48,889 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:49,372 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 280 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:45:50,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:50,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1580 states and 1914 transitions. [2018-11-10 12:45:50,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 1914 transitions. [2018-11-10 12:45:50,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-10 12:45:50,866 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:51,428 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 144 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:45:57,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:57,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 1649 states and 2004 transitions. [2018-11-10 12:45:57,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2004 transitions. [2018-11-10 12:45:57,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-10 12:45:57,234 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:57,300 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 118 proven. 5 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-10 12:45:59,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:45:59,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 1765 states and 2128 transitions. [2018-11-10 12:45:59,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2128 transitions. [2018-11-10 12:45:59,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-10 12:45:59,716 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:45:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:45:59,758 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-10 12:46:01,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:46:01,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2158 states to 1791 states and 2158 transitions. [2018-11-10 12:46:01,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2158 transitions. [2018-11-10 12:46:01,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-10 12:46:01,474 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:46:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:46:01,518 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-10 12:46:01,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:46:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2158 states to 1792 states and 2158 transitions. [2018-11-10 12:46:01,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2158 transitions. [2018-11-10 12:46:01,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-10 12:46:01,804 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:46:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:46:01,844 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-10 12:46:02,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:46:02,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 1803 states and 2168 transitions. [2018-11-10 12:46:02,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2168 transitions. [2018-11-10 12:46:02,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-10 12:46:02,571 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:46:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:46:02,612 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-10 12:46:03,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:46:03,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 1812 states and 2183 transitions. [2018-11-10 12:46:03,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 2183 transitions. [2018-11-10 12:46:03,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-10 12:46:03,213 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:46:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:46:03,319 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 152 proven. 4 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-10 12:46:03,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:46:03,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 1817 states and 2189 transitions. [2018-11-10 12:46:03,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2189 transitions. [2018-11-10 12:46:03,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-10 12:46:03,984 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:46:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:46:04,047 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 152 proven. 4 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-10 12:46:04,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:46:04,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 1821 states and 2193 transitions. [2018-11-10 12:46:04,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2193 transitions. [2018-11-10 12:46:04,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-10 12:46:04,369 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:46:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:46:04,489 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 167 proven. 5 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-10 12:46:05,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:46:05,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 1854 states and 2230 transitions. [2018-11-10 12:46:05,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2230 transitions. [2018-11-10 12:46:05,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-10 12:46:05,681 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:46:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:46:05,846 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 167 proven. 5 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-10 12:46:07,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:46:07,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 1869 states and 2246 transitions. [2018-11-10 12:46:07,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2246 transitions. [2018-11-10 12:46:07,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-10 12:46:07,092 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:46:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:46:07,205 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 167 proven. 5 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-10 12:46:08,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:46:08,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 1886 states and 2262 transitions. [2018-11-10 12:46:08,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2262 transitions. [2018-11-10 12:46:08,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-10 12:46:08,208 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:46:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:46:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 167 proven. 5 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-10 12:46:08,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:46:08,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 1887 states and 2262 transitions. [2018-11-10 12:46:08,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1887 states and 2262 transitions. [2018-11-10 12:46:08,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-10 12:46:08,688 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:46:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:46:08,801 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 167 proven. 5 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-10 12:46:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:46:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 1888 states and 2262 transitions. [2018-11-10 12:46:09,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1888 states and 2262 transitions. [2018-11-10 12:46:09,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-10 12:46:09,181 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:46:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:46:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 12:46:10,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:46:10,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 1959 states and 2336 transitions. [2018-11-10 12:46:10,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 2336 transitions. [2018-11-10 12:46:10,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-10 12:46:10,212 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:46:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:46:10,282 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 179 proven. 5 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-10 12:46:11,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:46:11,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 1978 states and 2356 transitions. [2018-11-10 12:46:11,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2356 transitions. [2018-11-10 12:46:11,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-10 12:46:11,144 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:46:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:46:11,204 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 179 proven. 5 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-10 12:46:11,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:46:11,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 1980 states and 2358 transitions. [2018-11-10 12:46:11,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 2358 transitions. [2018-11-10 12:46:11,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-10 12:46:11,799 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:46:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:46:11,854 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 179 proven. 5 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-10 12:46:12,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:46:12,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 1982 states and 2360 transitions. [2018-11-10 12:46:12,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 2360 transitions. [2018-11-10 12:46:12,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-10 12:46:12,406 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:46:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:46:12,464 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 179 proven. 5 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-10 12:46:12,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:46:12,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 1988 states and 2366 transitions. [2018-11-10 12:46:12,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1988 states and 2366 transitions. [2018-11-10 12:46:12,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-10 12:46:12,850 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:46:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:46:12,914 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 179 proven. 5 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-10 12:46:13,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:46:13,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 1992 states and 2369 transitions. [2018-11-10 12:46:13,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2369 transitions. [2018-11-10 12:46:13,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-10 12:46:13,232 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:46:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:46:13,289 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 179 proven. 5 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-10 12:46:13,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:46:13,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 1997 states and 2373 transitions. [2018-11-10 12:46:13,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2373 transitions. [2018-11-10 12:46:13,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-10 12:46:13,600 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:46:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:46:15,117 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 12:46:19,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 12:46:19,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2050 states and 2428 transitions. [2018-11-10 12:46:19,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 2428 transitions. [2018-11-10 12:46:19,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-10 12:46:19,137 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 12:46:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:46:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:46:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:46:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:46:19,407 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 130 iterations. [2018-11-10 12:46:19,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 12:46:19 ImpRootNode [2018-11-10 12:46:19,513 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 12:46:19,513 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:46:19,513 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:46:19,514 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:46:19,514 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:44:40" (3/4) ... [2018-11-10 12:46:19,516 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 12:46:19,625 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f973a999-a50b-4ddf-8664-1f5977786d0a/bin-2019/ukojak/witness.graphml [2018-11-10 12:46:19,625 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:46:19,625 INFO L168 Benchmark]: Toolchain (without parser) took 100446.72 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.1 GB). Free memory was 956.6 MB in the beginning and 1.3 GB in the end (delta: -305.0 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-11-10 12:46:19,626 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:46:19,626 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.45 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 924.3 MB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. [2018-11-10 12:46:19,626 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 924.3 MB in the beginning and 1.1 GB in the end (delta: -188.9 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2018-11-10 12:46:19,627 INFO L168 Benchmark]: Boogie Preprocessor took 40.22 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. [2018-11-10 12:46:19,627 INFO L168 Benchmark]: RCFGBuilder took 1251.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 871.2 MB in the end (delta: 236.6 MB). Peak memory consumption was 236.6 MB. Max. memory is 11.5 GB. [2018-11-10 12:46:19,627 INFO L168 Benchmark]: CodeCheck took 98588.00 ms. Allocated memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 871.2 MB in the beginning and 1.3 GB in the end (delta: -431.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-11-10 12:46:19,627 INFO L168 Benchmark]: Witness Printer took 111.54 ms. Allocated memory is still 3.1 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 41.5 MB). Peak memory consumption was 41.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:46:19,629 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 199 locations, 1 error locations. UNSAFE Result, 98.4s OverallTime, 130 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 744489476 SDtfs, -1337662180 SDslu, 1644171292 SDs, 0 SdLazy, -467154294 SolverSat, -2096624606 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 308.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 130850 GetRequests, 127491 SyntacticMatches, 2083 SemanticMatches, 1276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1205850 ImplicationChecksByTransitivity, 84.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 18803 NumberOfCodeBlocks, 18803 NumberOfCodeBlocksAsserted, 130 NumberOfCheckSat, 18455 ConstructedInterpolants, 0 QuantifiedInterpolants, 11028825 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 129 InterpolantComputations, 98 PerfectInterpolantSequences, 13307/13614 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 407]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] RET return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] RET return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] RET return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND 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] RET 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] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=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 TRUE (((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1)) [L103] a20 = 0 [L104] a8 = 15 [L105] a17 = 0 [L106] a21 = 1 [L107] RET return -1; VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] EXPR calculate_output(input) [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L591] CALL calculate_output(input) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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=0, a20=0, a21=1, a7=1, 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 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=5, a17=0, a20=0, a21=1, a7=1, a8=15, 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=5, a17=0, a20=0, a21=1, a7=1, a8=15, 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=5, a17=0, a20=0, a21=1, a7=1, a8=15, 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=5, a17=0, a20=0, a21=1, a7=1, a8=15, 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=5, a17=0, a20=0, a21=1, a7=1, a8=15, 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=5, a17=0, a20=0, a21=1, a7=1, a8=15, 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=5, a17=0, a20=0, a21=1, a7=1, a8=15, 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=5, a17=0, a20=0, a21=1, a7=1, a8=15, 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=5, a17=0, a20=0, a21=1, a7=1, a8=15, 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=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L394] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) [L397] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1))) [L400] COND FALSE !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1))) [L403] COND FALSE !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L406] COND TRUE ((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1)) VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] __VERIFIER_error() VAL [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=1, a8=15, 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.45 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 924.3 MB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 107.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 924.3 MB in the beginning and 1.1 GB in the end (delta: -188.9 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.22 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. * RCFGBuilder took 1251.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 871.2 MB in the end (delta: 236.6 MB). Peak memory consumption was 236.6 MB. Max. memory is 11.5 GB. * CodeCheck took 98588.00 ms. Allocated memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 871.2 MB in the beginning and 1.3 GB in the end (delta: -431.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 111.54 ms. Allocated memory is still 3.1 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 41.5 MB). Peak memory consumption was 41.5 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...