./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label45_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_5ea2f455-efb9-4dd9-b82b-384f5ed70ed6/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5ea2f455-efb9-4dd9-b82b-384f5ed70ed6/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5ea2f455-efb9-4dd9-b82b-384f5ed70ed6/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5ea2f455-efb9-4dd9-b82b-384f5ed70ed6/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label45_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5ea2f455-efb9-4dd9-b82b-384f5ed70ed6/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5ea2f455-efb9-4dd9-b82b-384f5ed70ed6/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 eadb33136c36588f3040fbda14d62db855361eef ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:43:35,640 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:43:35,641 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:43:35,648 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:43:35,648 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:43:35,649 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:43:35,650 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:43:35,651 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:43:35,652 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:43:35,652 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:43:35,653 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:43:35,653 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:43:35,654 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:43:35,654 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:43:35,655 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:43:35,656 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:43:35,656 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:43:35,657 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:43:35,659 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:43:35,660 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:43:35,660 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:43:35,661 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:43:35,662 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:43:35,663 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:43:35,663 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:43:35,663 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:43:35,664 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:43:35,664 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:43:35,665 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:43:35,666 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:43:35,666 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:43:35,666 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:43:35,666 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:43:35,666 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:43:35,667 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:43:35,668 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:43:35,668 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5ea2f455-efb9-4dd9-b82b-384f5ed70ed6/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-10 05:43:35,677 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:43:35,677 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:43:35,678 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 05:43:35,678 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 05:43:35,679 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:43:35,679 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:43:35,679 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:43:35,679 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:43:35,679 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:43:35,679 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:43:35,679 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:43:35,680 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 05:43:35,680 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 05:43:35,680 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 05:43:35,680 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:43:35,680 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:43:35,680 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 05:43:35,680 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-10 05:43:35,680 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-10 05:43:35,681 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:43:35,681 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 05:43:35,681 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 05:43:35,681 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:43:35,681 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 05:43:35,681 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 05:43:35,681 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-10 05:43:35,682 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 05:43:35,682 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 05:43:35,682 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_5ea2f455-efb9-4dd9-b82b-384f5ed70ed6/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 -> eadb33136c36588f3040fbda14d62db855361eef [2018-11-10 05:43:35,704 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:43:35,713 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:43:35,715 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:43:35,716 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:43:35,716 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:43:35,717 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5ea2f455-efb9-4dd9-b82b-384f5ed70ed6/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem02_label45_false-unreach-call_false-termination.c [2018-11-10 05:43:35,751 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5ea2f455-efb9-4dd9-b82b-384f5ed70ed6/bin-2019/ukojak/data/efc49dc84/447dc78581b64678b8c843fb0e4083f9/FLAG993d3100c [2018-11-10 05:43:36,202 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:43:36,203 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5ea2f455-efb9-4dd9-b82b-384f5ed70ed6/sv-benchmarks/c/eca-rers2012/Problem02_label45_false-unreach-call_false-termination.c [2018-11-10 05:43:36,211 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5ea2f455-efb9-4dd9-b82b-384f5ed70ed6/bin-2019/ukojak/data/efc49dc84/447dc78581b64678b8c843fb0e4083f9/FLAG993d3100c [2018-11-10 05:43:36,223 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5ea2f455-efb9-4dd9-b82b-384f5ed70ed6/bin-2019/ukojak/data/efc49dc84/447dc78581b64678b8c843fb0e4083f9 [2018-11-10 05:43:36,226 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:43:36,227 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:43:36,228 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:43:36,228 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:43:36,231 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:43:36,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:43:36" (1/1) ... [2018-11-10 05:43:36,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eeb45d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:36, skipping insertion in model container [2018-11-10 05:43:36,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:43:36" (1/1) ... [2018-11-10 05:43:36,242 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:43:36,278 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:43:36,501 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:43:36,504 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:43:36,569 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:43:36,581 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:43:36,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:36 WrapperNode [2018-11-10 05:43:36,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:43:36,582 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:43:36,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:43:36,583 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:43:36,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:36" (1/1) ... [2018-11-10 05:43:36,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:36" (1/1) ... [2018-11-10 05:43:36,690 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:43:36,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:43:36,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:43:36,690 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:43:36,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:36" (1/1) ... [2018-11-10 05:43:36,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:36" (1/1) ... [2018-11-10 05:43:36,702 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:36" (1/1) ... [2018-11-10 05:43:36,702 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:36" (1/1) ... [2018-11-10 05:43:36,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:36" (1/1) ... [2018-11-10 05:43:36,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:36" (1/1) ... [2018-11-10 05:43:36,729 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:36" (1/1) ... [2018-11-10 05:43:36,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:43:36,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:43:36,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:43:36,735 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:43:36,736 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:43:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5ea2f455-efb9-4dd9-b82b-384f5ed70ed6/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-10 05:43:36,787 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 05:43:36,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:43:36,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:43:38,034 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:43:38,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:43:38 BoogieIcfgContainer [2018-11-10 05:43:38,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:43:38,036 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-10 05:43:38,036 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-10 05:43:38,042 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-10 05:43:38,043 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:43:38" (1/1) ... [2018-11-10 05:43:38,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:43:38,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:38,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 86 states and 164 transitions. [2018-11-10 05:43:38,074 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 164 transitions. [2018-11-10 05:43:38,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 05:43:38,077 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:38,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:38,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:38,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 165 states and 244 transitions. [2018-11-10 05:43:38,812 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2018-11-10 05:43:38,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 05:43:38,813 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:38,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:39,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:39,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 245 states and 330 transitions. [2018-11-10 05:43:39,326 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 330 transitions. [2018-11-10 05:43:39,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 05:43:39,328 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:39,381 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 05:43:39,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:39,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 250 states and 337 transitions. [2018-11-10 05:43:39,520 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 337 transitions. [2018-11-10 05:43:39,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 05:43:39,522 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:39,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:39,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:39,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 260 states and 352 transitions. [2018-11-10 05:43:39,676 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 352 transitions. [2018-11-10 05:43:39,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 05:43:39,680 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:39,741 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 05:43:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:40,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 271 states and 372 transitions. [2018-11-10 05:43:40,062 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 372 transitions. [2018-11-10 05:43:40,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-10 05:43:40,063 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:40,082 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:40,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:40,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 274 states and 375 transitions. [2018-11-10 05:43:40,104 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 375 transitions. [2018-11-10 05:43:40,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 05:43:40,104 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:40,128 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 05:43:40,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:40,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 275 states and 377 transitions. [2018-11-10 05:43:40,230 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 377 transitions. [2018-11-10 05:43:40,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 05:43:40,231 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:40,254 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 05:43:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:40,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 279 states and 381 transitions. [2018-11-10 05:43:40,329 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 381 transitions. [2018-11-10 05:43:40,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-10 05:43:40,330 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:40,353 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 05:43:40,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:40,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 280 states and 384 transitions. [2018-11-10 05:43:40,460 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 384 transitions. [2018-11-10 05:43:40,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-10 05:43:40,461 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:40,483 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 05:43:40,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:40,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 284 states and 388 transitions. [2018-11-10 05:43:40,576 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 388 transitions. [2018-11-10 05:43:40,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 05:43:40,577 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:40,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:40,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 302 states and 419 transitions. [2018-11-10 05:43:40,988 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 419 transitions. [2018-11-10 05:43:40,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 05:43:40,989 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:41,007 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:41,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:41,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 309 states and 427 transitions. [2018-11-10 05:43:41,068 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 427 transitions. [2018-11-10 05:43:41,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-10 05:43:41,068 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:41,088 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:41,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:41,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 311 states and 429 transitions. [2018-11-10 05:43:41,106 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 429 transitions. [2018-11-10 05:43:41,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 05:43:41,107 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:41,131 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 05:43:41,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:41,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 316 states and 439 transitions. [2018-11-10 05:43:41,403 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 439 transitions. [2018-11-10 05:43:41,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 05:43:41,404 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:41,424 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 05:43:41,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:41,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 320 states and 443 transitions. [2018-11-10 05:43:41,525 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 443 transitions. [2018-11-10 05:43:41,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 05:43:41,526 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:41,547 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 05:43:41,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:41,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 324 states and 448 transitions. [2018-11-10 05:43:41,642 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 448 transitions. [2018-11-10 05:43:41,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 05:43:41,642 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:41,729 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:42,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:42,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 348 states and 480 transitions. [2018-11-10 05:43:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 480 transitions. [2018-11-10 05:43:42,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 05:43:42,259 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:42,276 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:42,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:42,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 353 states and 486 transitions. [2018-11-10 05:43:42,423 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 486 transitions. [2018-11-10 05:43:42,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 05:43:42,423 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:42,598 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 05:43:43,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:43,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 433 states and 572 transitions. [2018-11-10 05:43:43,186 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 572 transitions. [2018-11-10 05:43:43,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 05:43:43,187 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:43,215 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 05:43:43,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:43,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 438 states and 576 transitions. [2018-11-10 05:43:43,301 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 576 transitions. [2018-11-10 05:43:43,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 05:43:43,302 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:43,330 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:43,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:43,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 447 states and 588 transitions. [2018-11-10 05:43:43,625 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 588 transitions. [2018-11-10 05:43:43,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-10 05:43:43,626 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:43,652 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 05:43:43,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:43,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 449 states and 589 transitions. [2018-11-10 05:43:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2018-11-10 05:43:43,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 05:43:43,829 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:44,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:44,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 478 states and 627 transitions. [2018-11-10 05:43:44,702 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 627 transitions. [2018-11-10 05:43:44,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 05:43:44,703 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:44,801 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:44,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:44,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 482 states and 631 transitions. [2018-11-10 05:43:44,941 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 631 transitions. [2018-11-10 05:43:44,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 05:43:44,942 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:45,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:45,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 486 states and 635 transitions. [2018-11-10 05:43:45,209 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 635 transitions. [2018-11-10 05:43:45,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 05:43:45,210 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:45,298 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:45,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 490 states and 639 transitions. [2018-11-10 05:43:45,432 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 639 transitions. [2018-11-10 05:43:45,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 05:43:45,433 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:45,460 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 05:43:45,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:45,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 503 states and 653 transitions. [2018-11-10 05:43:45,698 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 653 transitions. [2018-11-10 05:43:45,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 05:43:45,699 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:45,726 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 05:43:46,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:46,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 511 states and 662 transitions. [2018-11-10 05:43:46,192 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 662 transitions. [2018-11-10 05:43:46,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 05:43:46,192 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:46,256 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 05:43:46,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:46,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 525 states and 678 transitions. [2018-11-10 05:43:46,615 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 678 transitions. [2018-11-10 05:43:46,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 05:43:46,616 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:46,644 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:46,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:46,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 540 states and 696 transitions. [2018-11-10 05:43:46,877 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 696 transitions. [2018-11-10 05:43:46,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 05:43:46,877 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:46,908 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:46,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 543 states and 699 transitions. [2018-11-10 05:43:46,934 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 699 transitions. [2018-11-10 05:43:46,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 05:43:46,935 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:46,964 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 05:43:47,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:47,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 555 states and 711 transitions. [2018-11-10 05:43:47,351 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 711 transitions. [2018-11-10 05:43:47,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-10 05:43:47,352 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:47,371 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 05:43:47,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:47,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 558 states and 713 transitions. [2018-11-10 05:43:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 713 transitions. [2018-11-10 05:43:47,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 05:43:47,457 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:47,799 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 05:43:49,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:49,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 600 states and 770 transitions. [2018-11-10 05:43:49,527 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 770 transitions. [2018-11-10 05:43:49,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 05:43:49,528 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:49,556 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 05:43:50,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:50,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 616 states and 786 transitions. [2018-11-10 05:43:50,222 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 786 transitions. [2018-11-10 05:43:50,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 05:43:50,240 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:50,282 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 05:43:50,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:50,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 629 states and 799 transitions. [2018-11-10 05:43:50,687 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 799 transitions. [2018-11-10 05:43:50,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-10 05:43:50,688 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:50,717 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 05:43:50,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:50,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 631 states and 802 transitions. [2018-11-10 05:43:50,985 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 802 transitions. [2018-11-10 05:43:50,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-10 05:43:50,985 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:51,012 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 05:43:51,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 634 states and 804 transitions. [2018-11-10 05:43:51,144 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 804 transitions. [2018-11-10 05:43:51,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-10 05:43:51,145 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:51,166 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 05:43:51,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:51,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 638 states and 807 transitions. [2018-11-10 05:43:51,258 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 807 transitions. [2018-11-10 05:43:51,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-10 05:43:51,259 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:51,286 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:51,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 668 states and 842 transitions. [2018-11-10 05:43:51,380 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 842 transitions. [2018-11-10 05:43:51,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 05:43:51,381 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:51,402 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:51,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:51,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 669 states and 844 transitions. [2018-11-10 05:43:51,581 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 844 transitions. [2018-11-10 05:43:51,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-10 05:43:51,581 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:51,603 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:51,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 673 states and 848 transitions. [2018-11-10 05:43:51,767 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 848 transitions. [2018-11-10 05:43:51,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-10 05:43:51,768 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:51,797 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:51,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:51,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 689 states and 866 transitions. [2018-11-10 05:43:51,866 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 866 transitions. [2018-11-10 05:43:51,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-10 05:43:51,867 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:51,964 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:52,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:52,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 711 states and 890 transitions. [2018-11-10 05:43:52,300 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 890 transitions. [2018-11-10 05:43:52,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-10 05:43:52,301 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:52,331 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:52,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 713 states and 892 transitions. [2018-11-10 05:43:52,355 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 892 transitions. [2018-11-10 05:43:52,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 05:43:52,356 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:52,697 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 74 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:54,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 778 states and 971 transitions. [2018-11-10 05:43:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 971 transitions. [2018-11-10 05:43:54,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 05:43:54,833 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:54,874 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 74 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:55,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:55,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 782 states and 976 transitions. [2018-11-10 05:43:55,100 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 976 transitions. [2018-11-10 05:43:55,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 05:43:55,101 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 74 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:55,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:55,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 786 states and 981 transitions. [2018-11-10 05:43:55,360 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 981 transitions. [2018-11-10 05:43:55,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-10 05:43:55,361 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:55,385 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:55,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 814 states and 1013 transitions. [2018-11-10 05:43:55,477 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1013 transitions. [2018-11-10 05:43:55,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-10 05:43:55,478 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:55,782 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:43:58,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:58,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 876 states and 1083 transitions. [2018-11-10 05:43:58,500 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1083 transitions. [2018-11-10 05:43:58,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-10 05:43:58,500 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:58,527 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 05:43:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:59,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 896 states and 1106 transitions. [2018-11-10 05:43:59,073 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1106 transitions. [2018-11-10 05:43:59,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-10 05:43:59,073 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:59,115 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 05:43:59,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:59,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 908 states and 1117 transitions. [2018-11-10 05:43:59,282 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1117 transitions. [2018-11-10 05:43:59,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-10 05:43:59,283 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:59,324 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 05:43:59,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:43:59,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 913 states and 1121 transitions. [2018-11-10 05:43:59,476 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1121 transitions. [2018-11-10 05:43:59,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-10 05:43:59,477 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:43:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:43:59,676 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 05:44:00,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:00,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 933 states and 1148 transitions. [2018-11-10 05:44:00,878 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1148 transitions. [2018-11-10 05:44:00,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-10 05:44:00,879 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:00,998 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 05:44:01,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:01,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 945 states and 1160 transitions. [2018-11-10 05:44:01,462 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1160 transitions. [2018-11-10 05:44:01,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-10 05:44:01,463 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:01,517 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:02,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:02,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 952 states and 1174 transitions. [2018-11-10 05:44:02,158 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1174 transitions. [2018-11-10 05:44:02,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-10 05:44:02,159 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:02,383 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 81 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:03,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:03,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 978 states and 1208 transitions. [2018-11-10 05:44:03,571 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1208 transitions. [2018-11-10 05:44:03,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-10 05:44:03,572 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:03,617 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 81 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:03,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:03,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 991 states and 1220 transitions. [2018-11-10 05:44:03,919 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1220 transitions. [2018-11-10 05:44:03,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-10 05:44:03,919 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:03,965 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 81 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:04,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:04,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1003 states and 1231 transitions. [2018-11-10 05:44:04,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1231 transitions. [2018-11-10 05:44:04,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-10 05:44:04,280 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:04,303 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 05:44:04,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1008 states and 1236 transitions. [2018-11-10 05:44:04,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1236 transitions. [2018-11-10 05:44:04,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-10 05:44:04,506 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:04,538 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 05:44:04,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:04,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1009 states and 1237 transitions. [2018-11-10 05:44:04,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1237 transitions. [2018-11-10 05:44:04,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-10 05:44:04,794 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:04,817 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 05:44:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:04,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1012 states and 1239 transitions. [2018-11-10 05:44:04,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1239 transitions. [2018-11-10 05:44:04,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-10 05:44:04,941 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:04,960 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 05:44:05,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:05,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1015 states and 1242 transitions. [2018-11-10 05:44:05,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1242 transitions. [2018-11-10 05:44:05,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-10 05:44:05,150 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:05,181 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 05:44:05,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:05,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1028 states and 1256 transitions. [2018-11-10 05:44:05,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1256 transitions. [2018-11-10 05:44:05,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-10 05:44:05,976 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 05:44:06,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:06,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1087 states and 1317 transitions. [2018-11-10 05:44:06,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1317 transitions. [2018-11-10 05:44:06,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-10 05:44:06,699 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:06,782 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:07,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:07,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1103 states and 1337 transitions. [2018-11-10 05:44:07,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1337 transitions. [2018-11-10 05:44:07,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-10 05:44:07,222 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:07,330 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:07,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:07,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1107 states and 1341 transitions. [2018-11-10 05:44:07,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1341 transitions. [2018-11-10 05:44:07,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-10 05:44:07,532 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:07,582 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:07,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:07,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1108 states and 1343 transitions. [2018-11-10 05:44:07,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1343 transitions. [2018-11-10 05:44:07,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-10 05:44:07,781 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:07,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:07,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1112 states and 1347 transitions. [2018-11-10 05:44:07,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1347 transitions. [2018-11-10 05:44:07,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-10 05:44:07,974 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:08,014 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-10 05:44:08,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:08,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1113 states and 1348 transitions. [2018-11-10 05:44:08,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1348 transitions. [2018-11-10 05:44:08,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-10 05:44:08,044 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:08,068 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 05:44:08,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:08,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1117 states and 1352 transitions. [2018-11-10 05:44:08,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1352 transitions. [2018-11-10 05:44:08,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-10 05:44:08,090 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:08,118 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 05:44:08,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:08,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1137 states and 1375 transitions. [2018-11-10 05:44:08,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1375 transitions. [2018-11-10 05:44:08,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-10 05:44:08,492 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:08,516 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 05:44:08,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:08,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1141 states and 1380 transitions. [2018-11-10 05:44:08,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1380 transitions. [2018-11-10 05:44:08,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-10 05:44:08,538 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:08,947 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 135 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 05:44:10,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:10,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1167 states and 1412 transitions. [2018-11-10 05:44:10,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1412 transitions. [2018-11-10 05:44:10,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-10 05:44:10,882 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:10,927 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 135 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 05:44:11,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:11,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1171 states and 1416 transitions. [2018-11-10 05:44:11,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1416 transitions. [2018-11-10 05:44:11,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-10 05:44:11,219 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:11,265 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 135 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 05:44:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:11,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1175 states and 1420 transitions. [2018-11-10 05:44:11,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1420 transitions. [2018-11-10 05:44:11,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-10 05:44:11,548 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:11,573 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 05:44:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:11,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1180 states and 1424 transitions. [2018-11-10 05:44:11,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1424 transitions. [2018-11-10 05:44:11,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-10 05:44:11,898 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:11,931 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 86 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 05:44:12,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:12,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1199 states and 1446 transitions. [2018-11-10 05:44:12,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1446 transitions. [2018-11-10 05:44:12,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 05:44:12,258 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:12,288 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-10 05:44:12,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:12,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1200 states and 1446 transitions. [2018-11-10 05:44:12,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1446 transitions. [2018-11-10 05:44:12,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-10 05:44:12,500 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:12,535 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 05:44:13,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1225 states and 1473 transitions. [2018-11-10 05:44:13,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1473 transitions. [2018-11-10 05:44:13,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-10 05:44:13,706 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:13,748 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 05:44:13,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:13,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1231 states and 1478 transitions. [2018-11-10 05:44:13,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1478 transitions. [2018-11-10 05:44:13,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 05:44:13,782 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:13,823 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 102 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 05:44:14,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:14,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1238 states and 1486 transitions. [2018-11-10 05:44:14,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1486 transitions. [2018-11-10 05:44:14,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 05:44:14,247 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:14,278 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 05:44:14,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:14,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1244 states and 1491 transitions. [2018-11-10 05:44:14,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1491 transitions. [2018-11-10 05:44:14,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 05:44:14,424 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:14,663 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 102 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:16,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:16,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1278 states and 1529 transitions. [2018-11-10 05:44:16,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1529 transitions. [2018-11-10 05:44:16,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 05:44:16,261 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:16,304 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 102 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:16,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:16,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1282 states and 1533 transitions. [2018-11-10 05:44:16,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1533 transitions. [2018-11-10 05:44:16,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 05:44:16,599 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:16,745 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 05:44:17,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:17,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1293 states and 1549 transitions. [2018-11-10 05:44:17,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1549 transitions. [2018-11-10 05:44:17,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 05:44:17,635 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:17,663 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 05:44:17,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:17,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1297 states and 1553 transitions. [2018-11-10 05:44:17,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1553 transitions. [2018-11-10 05:44:17,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-10 05:44:17,922 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:17,951 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-10 05:44:18,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:18,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1302 states and 1557 transitions. [2018-11-10 05:44:18,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1557 transitions. [2018-11-10 05:44:18,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-10 05:44:18,115 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:18,261 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 05:44:18,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:18,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1307 states and 1565 transitions. [2018-11-10 05:44:18,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1565 transitions. [2018-11-10 05:44:18,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 05:44:18,833 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:18,912 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 05:44:18,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:18,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1310 states and 1568 transitions. [2018-11-10 05:44:18,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1568 transitions. [2018-11-10 05:44:18,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-10 05:44:18,970 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:19,215 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 05:44:20,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:20,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1387 states and 1652 transitions. [2018-11-10 05:44:20,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 1652 transitions. [2018-11-10 05:44:20,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-10 05:44:20,251 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:20,278 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 05:44:20,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1390 states and 1655 transitions. [2018-11-10 05:44:20,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1655 transitions. [2018-11-10 05:44:20,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-10 05:44:20,300 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:21,143 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 152 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:24,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:24,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1746 states to 1462 states and 1746 transitions. [2018-11-10 05:44:24,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 1746 transitions. [2018-11-10 05:44:24,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-10 05:44:24,876 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:24,938 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 152 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:26,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:26,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1475 states and 1760 transitions. [2018-11-10 05:44:26,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1760 transitions. [2018-11-10 05:44:26,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-10 05:44:26,031 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:26,098 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 56 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-10 05:44:26,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:26,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1481 states and 1769 transitions. [2018-11-10 05:44:26,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 1769 transitions. [2018-11-10 05:44:26,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-10 05:44:26,540 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:26,629 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 56 proven. 5 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-10 05:44:27,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:27,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1485 states and 1774 transitions. [2018-11-10 05:44:27,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 1774 transitions. [2018-11-10 05:44:27,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-10 05:44:27,102 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:29,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:29,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1499 states and 1791 transitions. [2018-11-10 05:44:29,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1791 transitions. [2018-11-10 05:44:29,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-10 05:44:29,137 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:29,171 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-10 05:44:29,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:29,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1504 states and 1795 transitions. [2018-11-10 05:44:29,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1795 transitions. [2018-11-10 05:44:29,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-10 05:44:29,525 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:29,558 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 05:44:29,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:29,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1537 states and 1829 transitions. [2018-11-10 05:44:29,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 1829 transitions. [2018-11-10 05:44:29,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-10 05:44:29,787 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:29,823 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 111 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 05:44:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1538 states and 1832 transitions. [2018-11-10 05:44:29,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 1832 transitions. [2018-11-10 05:44:29,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-10 05:44:29,863 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:29,899 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 111 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 05:44:30,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:30,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1836 states to 1542 states and 1836 transitions. [2018-11-10 05:44:30,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 1836 transitions. [2018-11-10 05:44:30,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-10 05:44:30,188 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:30,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:30,238 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 111 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 05:44:30,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:30,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1546 states and 1840 transitions. [2018-11-10 05:44:30,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 1840 transitions. [2018-11-10 05:44:30,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-10 05:44:30,517 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 111 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 05:44:30,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:30,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1550 states and 1844 transitions. [2018-11-10 05:44:30,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 1844 transitions. [2018-11-10 05:44:30,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-10 05:44:30,848 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:30,948 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 159 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:31,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:31,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1557 states and 1857 transitions. [2018-11-10 05:44:31,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1857 transitions. [2018-11-10 05:44:31,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-10 05:44:31,790 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:31,852 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 159 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:32,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:32,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1559 states and 1858 transitions. [2018-11-10 05:44:32,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 1858 transitions. [2018-11-10 05:44:32,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-10 05:44:32,158 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:32,205 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 156 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 05:44:32,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:32,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1564 states and 1864 transitions. [2018-11-10 05:44:32,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1864 transitions. [2018-11-10 05:44:32,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-10 05:44:32,753 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:32,805 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 70 proven. 9 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-10 05:44:33,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:33,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1641 states and 1941 transitions. [2018-11-10 05:44:33,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 1941 transitions. [2018-11-10 05:44:33,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-10 05:44:33,578 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:33,608 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 05:44:34,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:34,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1682 states and 1986 transitions. [2018-11-10 05:44:34,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 1986 transitions. [2018-11-10 05:44:34,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-10 05:44:34,292 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:34,322 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 05:44:34,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:34,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 1700 states and 2004 transitions. [2018-11-10 05:44:34,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2004 transitions. [2018-11-10 05:44:34,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-11-10 05:44:34,689 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:34,723 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 05:44:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:34,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 1703 states and 2006 transitions. [2018-11-10 05:44:34,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2006 transitions. [2018-11-10 05:44:34,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-10 05:44:34,879 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:34,921 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 05:44:35,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:35,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 1708 states and 2011 transitions. [2018-11-10 05:44:35,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2011 transitions. [2018-11-10 05:44:35,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-10 05:44:35,399 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:36,189 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 05:44:40,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:40,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 1760 states and 2065 transitions. [2018-11-10 05:44:40,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2065 transitions. [2018-11-10 05:44:40,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-10 05:44:40,014 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 05:44:42,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:42,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 1806 states and 2110 transitions. [2018-11-10 05:44:42,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2110 transitions. [2018-11-10 05:44:42,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-10 05:44:42,725 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:42,828 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 05:44:43,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:43,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 1807 states and 2110 transitions. [2018-11-10 05:44:43,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2110 transitions. [2018-11-10 05:44:43,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-10 05:44:43,112 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:43,145 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 05:44:43,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:43,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 1828 states and 2131 transitions. [2018-11-10 05:44:43,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 2131 transitions. [2018-11-10 05:44:43,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-10 05:44:43,416 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:43,797 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:45,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 1842 states and 2152 transitions. [2018-11-10 05:44:45,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2152 transitions. [2018-11-10 05:44:45,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-10 05:44:45,681 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:45,870 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:44:46,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:46,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 1853 states and 2163 transitions. [2018-11-10 05:44:46,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2163 transitions. [2018-11-10 05:44:46,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-11-10 05:44:46,559 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:46,595 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-10 05:44:46,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:46,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 1856 states and 2165 transitions. [2018-11-10 05:44:46,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2165 transitions. [2018-11-10 05:44:46,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-10 05:44:46,756 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:47,514 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 05:44:53,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:53,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2227 states to 1909 states and 2227 transitions. [2018-11-10 05:44:53,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1909 states and 2227 transitions. [2018-11-10 05:44:53,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-10 05:44:53,149 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:53,269 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 05:44:55,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:55,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 1927 states and 2245 transitions. [2018-11-10 05:44:55,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 2245 transitions. [2018-11-10 05:44:55,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-10 05:44:55,887 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:55,991 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 05:44:57,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:57,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 1940 states and 2258 transitions. [2018-11-10 05:44:57,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 2258 transitions. [2018-11-10 05:44:57,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-10 05:44:57,502 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:57,615 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 05:44:58,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:58,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 1953 states and 2270 transitions. [2018-11-10 05:44:58,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 2270 transitions. [2018-11-10 05:44:58,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-10 05:44:58,959 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:44:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:44:59,057 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 05:44:59,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:44:59,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 1965 states and 2281 transitions. [2018-11-10 05:44:59,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2281 transitions. [2018-11-10 05:44:59,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-11-10 05:44:59,991 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:45:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:45:00,104 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 05:45:01,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:45:01,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 1978 states and 2293 transitions. [2018-11-10 05:45:01,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2293 transitions. [2018-11-10 05:45:01,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-10 05:45:01,203 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:45:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:45:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-10 05:45:03,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:45:03,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2036 states and 2352 transitions. [2018-11-10 05:45:03,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 2352 transitions. [2018-11-10 05:45:03,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-10 05:45:03,837 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:45:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:45:03,917 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-10 05:45:04,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:45:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2036 states and 2351 transitions. [2018-11-10 05:45:04,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 2351 transitions. [2018-11-10 05:45:04,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-10 05:45:04,314 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:45:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:45:04,394 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-10 05:45:04,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:45:04,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2008 states and 2322 transitions. [2018-11-10 05:45:04,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 2322 transitions. [2018-11-10 05:45:04,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-10 05:45:04,800 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:45:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:45:04,859 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 05:45:05,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-10 05:45:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 2020 states and 2333 transitions. [2018-11-10 05:45:05,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2333 transitions. [2018-11-10 05:45:05,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-11-10 05:45:05,040 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-11-10 05:45:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:45:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:45:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:45:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:45:05,228 WARN L496 CodeCheckObserver]: This program is UNSAFE, Check terminated with 129 iterations. [2018-11-10 05:45:05,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 10.11 05:45:05 ImpRootNode [2018-11-10 05:45:05,370 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-10 05:45:05,370 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:45:05,370 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:45:05,372 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:45:05,372 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:43:38" (3/4) ... [2018-11-10 05:45:05,375 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 05:45:05,477 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5ea2f455-efb9-4dd9-b82b-384f5ed70ed6/bin-2019/ukojak/witness.graphml [2018-11-10 05:45:05,477 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:45:05,478 INFO L168 Benchmark]: Toolchain (without parser) took 89251.96 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 952.1 MB in the beginning and 1.3 GB in the end (delta: -339.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-11-10 05:45:05,479 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:45:05,479 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.65 ms. Allocated memory is still 1.0 GB. Free memory was 952.1 MB in the beginning and 922.6 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:45:05,479 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 922.6 MB in the beginning and 1.2 GB in the end (delta: -249.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-10 05:45:05,480 INFO L168 Benchmark]: Boogie Preprocessor took 44.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-10 05:45:05,480 INFO L168 Benchmark]: RCFGBuilder took 1300.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 913.6 MB in the end (delta: 255.8 MB). Peak memory consumption was 255.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:45:05,480 INFO L168 Benchmark]: CodeCheck took 87334.20 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 913.6 MB in the beginning and 1.3 GB in the end (delta: -378.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-11-10 05:45:05,480 INFO L168 Benchmark]: Witness Printer took 107.48 ms. Allocated memory is still 2.8 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:45:05,482 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, 228 locations, 1 error locations. UNSAFE Result, 87.1s OverallTime, 129 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 965241856 SDtfs, 1148507056 SDslu, -1178084352 SDs, 0 SdLazy, 1802811566 SolverSat, 146439890 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 305.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135060 GetRequests, 131655 SyntacticMatches, 2403 SemanticMatches, 1002 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745856 ImplicationChecksByTransitivity, 73.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 20827 NumberOfCodeBlocks, 20827 NumberOfCodeBlocksAsserted, 129 NumberOfCheckSat, 20468 ConstructedInterpolants, 0 QuantifiedInterpolants, 14815909 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 128 InterpolantComputations, 99 PerfectInterpolantSequences, 14006/14291 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: 418]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L235] a28 = 9 [L236] RET return 23; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L395] a19 = 0 [L396] a28 = 7 [L397] RET return 25; VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL, EXPR calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND TRUE ((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1)) [L149] a11 = 1 [L150] a19 = 1 [L151] a28 = 10 [L152] a25 = 1 [L153] RET return -1; VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L398] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L402] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L407] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) [L414] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L418] __VERIFIER_error() VAL [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 354.65 ms. Allocated memory is still 1.0 GB. Free memory was 952.1 MB in the beginning and 922.6 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 107.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 922.6 MB in the beginning and 1.2 GB in the end (delta: -249.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1300.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 913.6 MB in the end (delta: 255.8 MB). Peak memory consumption was 255.8 MB. Max. memory is 11.5 GB. * CodeCheck took 87334.20 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 913.6 MB in the beginning and 1.3 GB in the end (delta: -378.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 107.48 ms. Allocated memory is still 2.8 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...