./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label50_false-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2abf6861-0abf-4c1c-bc39-be3ecb92ced1/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2abf6861-0abf-4c1c-bc39-be3ecb92ced1/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2abf6861-0abf-4c1c-bc39-be3ecb92ced1/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2abf6861-0abf-4c1c-bc39-be3ecb92ced1/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label50_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2abf6861-0abf-4c1c-bc39-be3ecb92ced1/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2abf6861-0abf-4c1c-bc39-be3ecb92ced1/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 c88dc41bb0c5752717ba5895f8d33afd40276a61 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 12:14:08,625 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 12:14:08,626 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 12:14:08,632 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 12:14:08,632 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 12:14:08,633 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 12:14:08,634 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 12:14:08,634 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 12:14:08,635 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 12:14:08,636 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 12:14:08,636 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 12:14:08,636 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 12:14:08,637 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 12:14:08,637 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 12:14:08,638 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 12:14:08,638 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 12:14:08,639 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 12:14:08,639 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 12:14:08,640 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 12:14:08,641 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 12:14:08,641 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 12:14:08,642 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 12:14:08,643 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 12:14:08,643 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 12:14:08,643 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 12:14:08,644 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 12:14:08,644 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 12:14:08,645 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 12:14:08,645 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 12:14:08,646 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 12:14:08,646 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 12:14:08,646 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 12:14:08,646 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 12:14:08,647 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 12:14:08,647 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 12:14:08,647 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 12:14:08,648 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2abf6861-0abf-4c1c-bc39-be3ecb92ced1/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-08 12:14:08,655 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 12:14:08,655 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 12:14:08,655 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 12:14:08,655 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-08 12:14:08,656 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 12:14:08,656 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 12:14:08,656 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 12:14:08,656 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 12:14:08,656 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 12:14:08,657 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 12:14:08,657 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 12:14:08,657 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 12:14:08,657 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 12:14:08,657 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 12:14:08,657 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 12:14:08,657 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 12:14:08,657 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 12:14:08,658 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 12:14:08,658 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-08 12:14:08,658 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-08 12:14:08,658 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 12:14:08,658 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 12:14:08,658 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-08 12:14:08,658 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 12:14:08,659 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 12:14:08,659 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 12:14:08,659 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-08 12:14:08,659 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 12:14:08,659 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 12:14:08,659 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_2abf6861-0abf-4c1c-bc39-be3ecb92ced1/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 -> c88dc41bb0c5752717ba5895f8d33afd40276a61 [2018-12-08 12:14:08,677 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 12:14:08,684 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 12:14:08,687 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 12:14:08,687 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 12:14:08,688 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 12:14:08,688 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2abf6861-0abf-4c1c-bc39-be3ecb92ced1/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem02_label50_false-unreach-call_false-termination.c [2018-12-08 12:14:08,724 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2abf6861-0abf-4c1c-bc39-be3ecb92ced1/bin-2019/ukojak/data/4201b7f10/bb472303c07d4b9dba6b54c881d48cd0/FLAG5db2f9ce4 [2018-12-08 12:14:09,183 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 12:14:09,184 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2abf6861-0abf-4c1c-bc39-be3ecb92ced1/sv-benchmarks/c/eca-rers2012/Problem02_label50_false-unreach-call_false-termination.c [2018-12-08 12:14:09,191 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2abf6861-0abf-4c1c-bc39-be3ecb92ced1/bin-2019/ukojak/data/4201b7f10/bb472303c07d4b9dba6b54c881d48cd0/FLAG5db2f9ce4 [2018-12-08 12:14:09,200 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2abf6861-0abf-4c1c-bc39-be3ecb92ced1/bin-2019/ukojak/data/4201b7f10/bb472303c07d4b9dba6b54c881d48cd0 [2018-12-08 12:14:09,202 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 12:14:09,203 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 12:14:09,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 12:14:09,203 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 12:14:09,205 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 12:14:09,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 12:14:09" (1/1) ... [2018-12-08 12:14:09,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27d92faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:14:09, skipping insertion in model container [2018-12-08 12:14:09,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 12:14:09" (1/1) ... [2018-12-08 12:14:09,212 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 12:14:09,243 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 12:14:09,450 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 12:14:09,455 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 12:14:09,554 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 12:14:09,564 INFO L195 MainTranslator]: Completed translation [2018-12-08 12:14:09,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:14:09 WrapperNode [2018-12-08 12:14:09,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 12:14:09,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 12:14:09,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 12:14:09,565 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 12:14:09,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:14:09" (1/1) ... [2018-12-08 12:14:09,581 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:14:09" (1/1) ... [2018-12-08 12:14:09,614 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 12:14:09,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 12:14:09,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 12:14:09,614 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 12:14:09,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:14:09" (1/1) ... [2018-12-08 12:14:09,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:14:09" (1/1) ... [2018-12-08 12:14:09,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:14:09" (1/1) ... [2018-12-08 12:14:09,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:14:09" (1/1) ... [2018-12-08 12:14:09,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:14:09" (1/1) ... [2018-12-08 12:14:09,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:14:09" (1/1) ... [2018-12-08 12:14:09,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:14:09" (1/1) ... [2018-12-08 12:14:09,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 12:14:09,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 12:14:09,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 12:14:09,643 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 12:14:09,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:14:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2abf6861-0abf-4c1c-bc39-be3ecb92ced1/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-08 12:14:09,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 12:14:09,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 12:14:10,657 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 12:14:10,657 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-08 12:14:10,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:14:10 BoogieIcfgContainer [2018-12-08 12:14:10,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 12:14:10,658 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-08 12:14:10,658 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-08 12:14:10,665 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-08 12:14:10,666 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:14:10" (1/1) ... [2018-12-08 12:14:10,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:14:10,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:10,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 85 states and 162 transitions. [2018-12-08 12:14:10,694 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 162 transitions. [2018-12-08 12:14:10,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-08 12:14:10,697 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:10,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:14:11,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:11,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 163 states and 242 transitions. [2018-12-08 12:14:11,236 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2018-12-08 12:14:11,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-08 12:14:11,237 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:11,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:14:11,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:11,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 242 states and 336 transitions. [2018-12-08 12:14:11,606 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 336 transitions. [2018-12-08 12:14:11,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-08 12:14:11,607 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:11,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:14:11,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:11,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 246 states and 341 transitions. [2018-12-08 12:14:11,727 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 341 transitions. [2018-12-08 12:14:11,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-08 12:14:11,728 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:11,754 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:14:11,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:11,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 255 states and 355 transitions. [2018-12-08 12:14:11,859 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 355 transitions. [2018-12-08 12:14:11,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-08 12:14:11,863 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:11,881 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:14:11,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:11,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 258 states and 358 transitions. [2018-12-08 12:14:11,901 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 358 transitions. [2018-12-08 12:14:11,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 12:14:11,902 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:11,915 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:14:12,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:12,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 262 states and 364 transitions. [2018-12-08 12:14:12,039 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 364 transitions. [2018-12-08 12:14:12,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-08 12:14:12,040 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:12,062 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 12:14:12,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:12,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 266 states and 369 transitions. [2018-12-08 12:14:12,202 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 369 transitions. [2018-12-08 12:14:12,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-08 12:14:12,203 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:12,243 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:14:12,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:12,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 283 states and 394 transitions. [2018-12-08 12:14:12,382 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 394 transitions. [2018-12-08 12:14:12,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 12:14:12,383 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:12,397 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 12:14:12,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:12,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 284 states and 396 transitions. [2018-12-08 12:14:12,462 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 396 transitions. [2018-12-08 12:14:12,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 12:14:12,462 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:12,476 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 12:14:12,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:12,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 287 states and 399 transitions. [2018-12-08 12:14:12,557 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 399 transitions. [2018-12-08 12:14:12,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 12:14:12,558 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:12,581 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:14:12,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:12,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 290 states and 403 transitions. [2018-12-08 12:14:12,648 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 403 transitions. [2018-12-08 12:14:12,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 12:14:12,649 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:12,725 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:14:13,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:13,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 313 states and 434 transitions. [2018-12-08 12:14:13,139 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 434 transitions. [2018-12-08 12:14:13,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-08 12:14:13,140 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:13,153 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 12:14:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:13,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 315 states and 436 transitions. [2018-12-08 12:14:13,205 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 436 transitions. [2018-12-08 12:14:13,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-08 12:14:13,206 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 12:14:13,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 394 states and 518 transitions. [2018-12-08 12:14:13,672 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 518 transitions. [2018-12-08 12:14:13,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-08 12:14:13,672 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:13,750 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:14:14,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 416 states and 548 transitions. [2018-12-08 12:14:14,374 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 548 transitions. [2018-12-08 12:14:14,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-08 12:14:14,375 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:14,444 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:14:14,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:14,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 419 states and 551 transitions. [2018-12-08 12:14:14,529 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 551 transitions. [2018-12-08 12:14:14,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-08 12:14:14,530 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:14,620 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:14:14,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 422 states and 554 transitions. [2018-12-08 12:14:14,720 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 554 transitions. [2018-12-08 12:14:14,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-08 12:14:14,721 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:14,941 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 39 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:14:15,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:15,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 454 states and 599 transitions. [2018-12-08 12:14:15,945 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 599 transitions. [2018-12-08 12:14:15,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-08 12:14:15,946 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:15,983 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 39 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:14:16,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:16,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 457 states and 602 transitions. [2018-12-08 12:14:16,167 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 602 transitions. [2018-12-08 12:14:16,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-08 12:14:16,168 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 12:14:16,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:16,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 459 states and 604 transitions. [2018-12-08 12:14:16,271 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 604 transitions. [2018-12-08 12:14:16,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-08 12:14:16,272 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:16,292 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 12:14:16,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:16,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 473 states and 624 transitions. [2018-12-08 12:14:16,491 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 624 transitions. [2018-12-08 12:14:16,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 12:14:16,492 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:16,507 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 12:14:16,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:16,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 477 states and 628 transitions. [2018-12-08 12:14:16,589 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 628 transitions. [2018-12-08 12:14:16,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 12:14:16,590 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:16,608 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-08 12:14:16,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:16,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 484 states and 635 transitions. [2018-12-08 12:14:16,633 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 635 transitions. [2018-12-08 12:14:16,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-08 12:14:16,634 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:16,647 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-08 12:14:16,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 491 states and 643 transitions. [2018-12-08 12:14:16,842 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 643 transitions. [2018-12-08 12:14:16,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-08 12:14:16,843 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:17,038 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 12:14:18,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:18,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 515 states and 673 transitions. [2018-12-08 12:14:18,049 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 673 transitions. [2018-12-08 12:14:18,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-08 12:14:18,050 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:18,075 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 12:14:18,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:18,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 519 states and 676 transitions. [2018-12-08 12:14:18,215 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 676 transitions. [2018-12-08 12:14:18,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-08 12:14:18,215 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:18,252 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 12:14:18,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:18,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 525 states and 683 transitions. [2018-12-08 12:14:18,407 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 683 transitions. [2018-12-08 12:14:18,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-08 12:14:18,407 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:18,421 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-08 12:14:18,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:18,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 529 states and 691 transitions. [2018-12-08 12:14:18,546 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 691 transitions. [2018-12-08 12:14:18,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-08 12:14:18,546 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:18,609 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 12:14:18,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:18,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 550 states and 713 transitions. [2018-12-08 12:14:18,853 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 713 transitions. [2018-12-08 12:14:18,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-08 12:14:18,854 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-08 12:14:18,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:18,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 551 states and 714 transitions. [2018-12-08 12:14:18,877 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 714 transitions. [2018-12-08 12:14:18,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-08 12:14:18,877 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:18,891 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-08 12:14:18,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:18,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 552 states and 715 transitions. [2018-12-08 12:14:18,904 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 715 transitions. [2018-12-08 12:14:18,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-08 12:14:18,904 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:19,026 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:14:19,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 570 states and 740 transitions. [2018-12-08 12:14:19,942 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 740 transitions. [2018-12-08 12:14:19,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-08 12:14:19,943 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:20,015 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:14:20,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:20,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 573 states and 743 transitions. [2018-12-08 12:14:20,200 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 743 transitions. [2018-12-08 12:14:20,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-08 12:14:20,201 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:20,217 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 12:14:20,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:20,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 589 states and 761 transitions. [2018-12-08 12:14:20,271 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 761 transitions. [2018-12-08 12:14:20,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-08 12:14:20,271 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:20,285 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-08 12:14:20,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 591 states and 762 transitions. [2018-12-08 12:14:20,300 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 762 transitions. [2018-12-08 12:14:20,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-08 12:14:20,300 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:20,322 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-08 12:14:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 598 states and 772 transitions. [2018-12-08 12:14:20,727 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 772 transitions. [2018-12-08 12:14:20,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-08 12:14:20,727 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:20,746 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-08 12:14:20,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:20,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 602 states and 777 transitions. [2018-12-08 12:14:20,918 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 777 transitions. [2018-12-08 12:14:20,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-08 12:14:20,918 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:20,933 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-08 12:14:21,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:21,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 611 states and 787 transitions. [2018-12-08 12:14:21,050 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 787 transitions. [2018-12-08 12:14:21,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-08 12:14:21,051 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:21,065 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 12:14:21,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:21,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 613 states and 789 transitions. [2018-12-08 12:14:21,079 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 789 transitions. [2018-12-08 12:14:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-08 12:14:21,079 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:21,161 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-08 12:14:21,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:21,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 617 states and 796 transitions. [2018-12-08 12:14:21,588 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 796 transitions. [2018-12-08 12:14:21,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-08 12:14:21,588 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:21,609 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 12:14:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:21,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 619 states and 798 transitions. [2018-12-08 12:14:21,626 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 798 transitions. [2018-12-08 12:14:21,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-08 12:14:21,627 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:21,757 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 58 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-08 12:14:22,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:22,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 669 states and 854 transitions. [2018-12-08 12:14:22,466 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 854 transitions. [2018-12-08 12:14:22,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-08 12:14:22,466 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:22,490 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-08 12:14:22,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:22,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 674 states and 861 transitions. [2018-12-08 12:14:22,924 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 861 transitions. [2018-12-08 12:14:22,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-08 12:14:22,925 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:22,942 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-08 12:14:22,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:22,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 675 states and 862 transitions. [2018-12-08 12:14:22,955 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 862 transitions. [2018-12-08 12:14:22,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-08 12:14:22,956 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:22,977 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-08 12:14:23,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:23,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 685 states and 875 transitions. [2018-12-08 12:14:23,329 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 875 transitions. [2018-12-08 12:14:23,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-08 12:14:23,329 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:23,345 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-08 12:14:23,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:23,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 687 states and 876 transitions. [2018-12-08 12:14:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 876 transitions. [2018-12-08 12:14:23,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-08 12:14:23,513 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:23,530 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-08 12:14:23,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:23,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 688 states and 877 transitions. [2018-12-08 12:14:23,541 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 877 transitions. [2018-12-08 12:14:23,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-08 12:14:23,542 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-08 12:14:23,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:23,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 702 states and 891 transitions. [2018-12-08 12:14:23,921 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 891 transitions. [2018-12-08 12:14:23,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-08 12:14:23,922 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:23,938 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 12:14:23,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:23,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 706 states and 894 transitions. [2018-12-08 12:14:23,955 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 894 transitions. [2018-12-08 12:14:23,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-08 12:14:23,956 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-08 12:14:24,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:24,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 724 states and 916 transitions. [2018-12-08 12:14:24,736 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 916 transitions. [2018-12-08 12:14:24,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-08 12:14:24,737 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:24,801 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-08 12:14:24,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:24,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 725 states and 916 transitions. [2018-12-08 12:14:24,816 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 916 transitions. [2018-12-08 12:14:24,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-08 12:14:24,816 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:24,883 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-08 12:14:24,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:24,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 726 states and 917 transitions. [2018-12-08 12:14:24,922 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 917 transitions. [2018-12-08 12:14:24,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-08 12:14:24,923 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:24,938 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-08 12:14:25,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:25,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 730 states and 922 transitions. [2018-12-08 12:14:25,117 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 922 transitions. [2018-12-08 12:14:25,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-08 12:14:25,117 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:25,150 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:14:25,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:25,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 758 states and 953 transitions. [2018-12-08 12:14:25,404 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 953 transitions. [2018-12-08 12:14:25,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 12:14:25,404 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:25,460 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 73 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 12:14:26,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:26,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 786 states and 987 transitions. [2018-12-08 12:14:26,585 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 987 transitions. [2018-12-08 12:14:26,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 12:14:26,585 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:26,650 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 73 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 12:14:26,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:26,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 789 states and 990 transitions. [2018-12-08 12:14:26,836 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 990 transitions. [2018-12-08 12:14:26,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-08 12:14:26,837 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:26,851 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-08 12:14:26,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:26,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 792 states and 993 transitions. [2018-12-08 12:14:26,879 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 993 transitions. [2018-12-08 12:14:26,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-08 12:14:26,879 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:26,947 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-08 12:14:27,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 810 states and 1011 transitions. [2018-12-08 12:14:27,545 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1011 transitions. [2018-12-08 12:14:27,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-08 12:14:27,545 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:27,610 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-08 12:14:27,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:27,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 816 states and 1017 transitions. [2018-12-08 12:14:27,928 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1017 transitions. [2018-12-08 12:14:27,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-08 12:14:27,929 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:27,985 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:14:28,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 836 states and 1038 transitions. [2018-12-08 12:14:28,319 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1038 transitions. [2018-12-08 12:14:28,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-08 12:14:28,320 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:28,379 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:14:29,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:29,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 852 states and 1061 transitions. [2018-12-08 12:14:29,082 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1061 transitions. [2018-12-08 12:14:29,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-08 12:14:29,083 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:29,137 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:14:29,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:29,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 855 states and 1064 transitions. [2018-12-08 12:14:29,328 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1064 transitions. [2018-12-08 12:14:29,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-08 12:14:29,329 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:29,398 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:14:29,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:29,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 858 states and 1067 transitions. [2018-12-08 12:14:29,582 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1067 transitions. [2018-12-08 12:14:29,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-08 12:14:29,583 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:29,706 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 12:14:30,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:30,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 882 states and 1094 transitions. [2018-12-08 12:14:30,589 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1094 transitions. [2018-12-08 12:14:30,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-08 12:14:30,590 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:30,615 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-08 12:14:31,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:31,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 978 states and 1193 transitions. [2018-12-08 12:14:31,194 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1193 transitions. [2018-12-08 12:14:31,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-08 12:14:31,195 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:31,214 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 12:14:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:31,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1000 states and 1216 transitions. [2018-12-08 12:14:31,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1216 transitions. [2018-12-08 12:14:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-08 12:14:31,443 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:31,486 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-08 12:14:31,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:31,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1001 states and 1216 transitions. [2018-12-08 12:14:31,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1216 transitions. [2018-12-08 12:14:31,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-08 12:14:31,517 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:31,586 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 12:14:32,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:32,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1013 states and 1231 transitions. [2018-12-08 12:14:32,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1231 transitions. [2018-12-08 12:14:32,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-08 12:14:32,126 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:32,471 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 128 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 12:14:34,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1028 states and 1257 transitions. [2018-12-08 12:14:34,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1257 transitions. [2018-12-08 12:14:34,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-08 12:14:34,927 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:34,971 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 128 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 12:14:35,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:35,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1034 states and 1264 transitions. [2018-12-08 12:14:35,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1264 transitions. [2018-12-08 12:14:35,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-08 12:14:35,426 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:35,447 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 12:14:35,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:35,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1039 states and 1269 transitions. [2018-12-08 12:14:35,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1269 transitions. [2018-12-08 12:14:35,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-08 12:14:35,735 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:35,756 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 12:14:36,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:36,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1056 states and 1289 transitions. [2018-12-08 12:14:36,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1289 transitions. [2018-12-08 12:14:36,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-08 12:14:36,439 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:36,460 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 12:14:36,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:36,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1062 states and 1295 transitions. [2018-12-08 12:14:36,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1295 transitions. [2018-12-08 12:14:36,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-08 12:14:36,661 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:36,683 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 12:14:36,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:36,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1066 states and 1298 transitions. [2018-12-08 12:14:36,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1298 transitions. [2018-12-08 12:14:36,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-08 12:14:36,912 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:36,932 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 12:14:37,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:37,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1070 states and 1303 transitions. [2018-12-08 12:14:37,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1303 transitions. [2018-12-08 12:14:37,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-08 12:14:37,055 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 12:14:37,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:37,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1083 states and 1315 transitions. [2018-12-08 12:14:37,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1315 transitions. [2018-12-08 12:14:37,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-08 12:14:37,226 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:37,301 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-12-08 12:14:38,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:38,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1101 states and 1333 transitions. [2018-12-08 12:14:38,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1333 transitions. [2018-12-08 12:14:38,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-08 12:14:38,087 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:38,168 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-12-08 12:14:38,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:38,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1107 states and 1339 transitions. [2018-12-08 12:14:38,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 1339 transitions. [2018-12-08 12:14:38,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-08 12:14:38,600 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:38,727 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 12:14:39,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:39,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1132 states and 1364 transitions. [2018-12-08 12:14:39,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1364 transitions. [2018-12-08 12:14:39,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-08 12:14:39,896 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:40,005 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-08 12:14:40,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:40,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1170 states and 1407 transitions. [2018-12-08 12:14:40,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1407 transitions. [2018-12-08 12:14:40,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-08 12:14:40,853 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:40,883 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 12:14:40,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:40,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1184 states and 1421 transitions. [2018-12-08 12:14:40,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1421 transitions. [2018-12-08 12:14:40,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-08 12:14:40,929 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 12:14:40,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:40,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1190 states and 1426 transitions. [2018-12-08 12:14:40,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1426 transitions. [2018-12-08 12:14:40,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-08 12:14:40,987 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:41,129 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-08 12:14:42,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:42,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1200 states and 1443 transitions. [2018-12-08 12:14:42,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1443 transitions. [2018-12-08 12:14:42,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-08 12:14:42,217 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:42,249 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-08 12:14:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:42,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1203 states and 1446 transitions. [2018-12-08 12:14:42,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1446 transitions. [2018-12-08 12:14:42,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-08 12:14:42,466 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-08 12:14:42,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1234 states and 1477 transitions. [2018-12-08 12:14:42,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1477 transitions. [2018-12-08 12:14:42,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-08 12:14:42,676 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:42,698 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-08 12:14:42,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:42,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1240 states and 1482 transitions. [2018-12-08 12:14:42,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1482 transitions. [2018-12-08 12:14:42,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-08 12:14:42,933 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:43,051 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 108 proven. 8 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-08 12:14:43,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:43,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1267 states and 1509 transitions. [2018-12-08 12:14:43,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1509 transitions. [2018-12-08 12:14:43,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-08 12:14:43,123 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:43,147 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-08 12:14:43,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:43,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1270 states and 1511 transitions. [2018-12-08 12:14:43,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1511 transitions. [2018-12-08 12:14:43,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-08 12:14:43,280 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:43,423 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-08 12:14:43,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1275 states and 1520 transitions. [2018-12-08 12:14:43,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1520 transitions. [2018-12-08 12:14:43,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-08 12:14:43,972 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:44,095 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 120 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-12-08 12:14:47,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:47,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1338 states and 1597 transitions. [2018-12-08 12:14:47,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1597 transitions. [2018-12-08 12:14:47,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-08 12:14:47,075 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:47,100 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-08 12:14:47,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:47,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1341 states and 1599 transitions. [2018-12-08 12:14:47,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1599 transitions. [2018-12-08 12:14:47,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-08 12:14:47,213 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:47,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 12:14:47,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:47,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1356 states and 1614 transitions. [2018-12-08 12:14:47,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1614 transitions. [2018-12-08 12:14:47,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-08 12:14:47,307 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 102 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 12:14:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:47,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1375 states and 1634 transitions. [2018-12-08 12:14:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1634 transitions. [2018-12-08 12:14:47,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-08 12:14:47,640 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 102 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 12:14:48,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:48,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1386 states and 1647 transitions. [2018-12-08 12:14:48,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1647 transitions. [2018-12-08 12:14:48,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-08 12:14:48,243 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 102 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 12:14:48,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1389 states and 1650 transitions. [2018-12-08 12:14:48,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1650 transitions. [2018-12-08 12:14:48,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-08 12:14:48,510 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:48,676 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-12-08 12:14:49,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:49,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1398 states and 1664 transitions. [2018-12-08 12:14:49,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1664 transitions. [2018-12-08 12:14:49,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-08 12:14:49,279 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 12:14:49,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:49,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1413 states and 1679 transitions. [2018-12-08 12:14:49,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1679 transitions. [2018-12-08 12:14:49,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-08 12:14:49,740 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:49,813 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 12:14:50,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:50,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1422 states and 1692 transitions. [2018-12-08 12:14:50,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1692 transitions. [2018-12-08 12:14:50,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-08 12:14:50,142 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:50,235 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 12:14:50,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:50,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1425 states and 1695 transitions. [2018-12-08 12:14:50,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 1695 transitions. [2018-12-08 12:14:50,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-08 12:14:50,476 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:50,559 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 115 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 12:14:50,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:50,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1428 states and 1698 transitions. [2018-12-08 12:14:50,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1698 transitions. [2018-12-08 12:14:50,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-08 12:14:50,819 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:50,851 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-08 12:14:51,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:51,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1443 states and 1718 transitions. [2018-12-08 12:14:51,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1718 transitions. [2018-12-08 12:14:51,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-08 12:14:51,875 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:51,920 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-08 12:14:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:52,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1451 states and 1727 transitions. [2018-12-08 12:14:52,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1727 transitions. [2018-12-08 12:14:52,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-08 12:14:52,378 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:52,414 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-08 12:14:52,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:52,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1468 states and 1743 transitions. [2018-12-08 12:14:52,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1743 transitions. [2018-12-08 12:14:52,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-08 12:14:52,580 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:52,698 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 12:14:53,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:53,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1477 states and 1755 transitions. [2018-12-08 12:14:53,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 1755 transitions. [2018-12-08 12:14:53,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-08 12:14:53,367 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 12:14:53,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:53,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1482 states and 1761 transitions. [2018-12-08 12:14:53,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1761 transitions. [2018-12-08 12:14:53,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-08 12:14:53,882 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:53,912 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-08 12:14:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:54,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1505 states and 1783 transitions. [2018-12-08 12:14:54,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1783 transitions. [2018-12-08 12:14:54,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-08 12:14:54,628 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:54,668 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-08 12:14:54,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:54,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1507 states and 1784 transitions. [2018-12-08 12:14:54,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1784 transitions. [2018-12-08 12:14:54,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-08 12:14:54,816 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:54,841 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 12:14:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1545 states and 1824 transitions. [2018-12-08 12:14:55,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1824 transitions. [2018-12-08 12:14:55,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-08 12:14:55,109 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:55,278 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 12:14:57,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:57,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1650 states and 1932 transitions. [2018-12-08 12:14:57,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 1932 transitions. [2018-12-08 12:14:57,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-08 12:14:57,301 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:57,327 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-08 12:14:57,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:57,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1653 states and 1934 transitions. [2018-12-08 12:14:57,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 1934 transitions. [2018-12-08 12:14:57,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-08 12:14:57,467 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:57,532 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-08 12:14:57,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:57,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1663 states and 1944 transitions. [2018-12-08 12:14:57,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 1944 transitions. [2018-12-08 12:14:57,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-12-08 12:14:57,969 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:14:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 164 proven. 16 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-08 12:14:58,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-08 12:14:58,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1671 states and 1951 transitions. [2018-12-08 12:14:58,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 1951 transitions. [2018-12-08 12:14:58,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-08 12:14:58,379 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-08 12:14:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:14:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:14:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:14:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:14:58,521 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 113 iterations. [2018-12-08 12:14:58,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 08.12 12:14:58 ImpRootNode [2018-12-08 12:14:58,609 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-08 12:14:58,609 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 12:14:58,609 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 12:14:58,609 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 12:14:58,610 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:14:10" (3/4) ... [2018-12-08 12:14:58,611 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 12:14:58,692 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2abf6861-0abf-4c1c-bc39-be3ecb92ced1/bin-2019/ukojak/witness.graphml [2018-12-08 12:14:58,692 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 12:14:58,692 INFO L168 Benchmark]: Toolchain (without parser) took 49490.26 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 1.0 GB). Free memory was 945.2 MB in the beginning and 818.7 MB in the end (delta: 126.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-12-08 12:14:58,693 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:14:58,693 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -154.2 MB). Peak memory consumption was 40.4 MB. Max. memory is 11.5 GB. [2018-12-08 12:14:58,693 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 12:14:58,693 INFO L168 Benchmark]: Boogie Preprocessor took 28.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 12:14:58,694 INFO L168 Benchmark]: RCFGBuilder took 1014.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 867.1 MB in the end (delta: 221.6 MB). Peak memory consumption was 221.6 MB. Max. memory is 11.5 GB. [2018-12-08 12:14:58,694 INFO L168 Benchmark]: CodeCheck took 47950.83 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 892.9 MB). Free memory was 867.1 MB in the beginning and 841.4 MB in the end (delta: 25.7 MB). Peak memory consumption was 918.6 MB. Max. memory is 11.5 GB. [2018-12-08 12:14:58,694 INFO L168 Benchmark]: Witness Printer took 82.63 ms. Allocated memory is still 2.0 GB. Free memory was 841.4 MB in the beginning and 818.7 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2018-12-08 12:14:58,695 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 227 locations, 1 error locations. UNSAFE Result, 47.8s OverallTime, 113 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -1054739904 SDtfs, 1611261408 SDslu, 1189940128 SDs, 0 SdLazy, 1717387260 SolverSat, 1456545136 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 211.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 106760 GetRequests, 105362 SyntacticMatches, 678 SemanticMatches, 720 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359910 ImplicationChecksByTransitivity, 38.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 16895 NumberOfCodeBlocks, 16895 NumberOfCodeBlocksAsserted, 113 NumberOfCheckSat, 16573 ConstructedInterpolants, 0 QuantifiedInterpolants, 5676094 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 112 InterpolantComputations, 90 PerfectInterpolantSequences, 10895/11114 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: 415]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L235] a28 = 9 [L236] return 23; VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L59] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L74] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L82] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L91] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L95] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L99] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L106] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L113] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L130] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L134] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L139] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L143] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L159] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L187] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L191] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L198] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L202] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L215] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L232] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L234] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L237] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L248] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L253] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L259] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L276] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L280] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L283] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L291] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L297] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L309] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L314] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L328] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L331] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L349] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L354] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L368] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L375] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L380] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L389] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L395] a19 = 0 [L396] a28 = 7 [L397] return 25; VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L47] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L50] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND TRUE ((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1)) [L55] a28 = 7 [L56] a11 = 1 [L57] a25 = 0 [L58] return -1; VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a=1, a11=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a=1, a11=1, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L154] COND 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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [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=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] [L409] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) VAL [a=1, a11=1, 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] [L414] COND TRUE (((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8)) VAL [a=1, a11=1, 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] [L415] __VERIFIER_error() VAL [a=1, a11=1, 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] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 361.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -154.2 MB). Peak memory consumption was 40.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1014.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 867.1 MB in the end (delta: 221.6 MB). Peak memory consumption was 221.6 MB. Max. memory is 11.5 GB. * CodeCheck took 47950.83 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 892.9 MB). Free memory was 867.1 MB in the beginning and 841.4 MB in the end (delta: 25.7 MB). Peak memory consumption was 918.6 MB. Max. memory is 11.5 GB. * Witness Printer took 82.63 ms. Allocated memory is still 2.0 GB. Free memory was 841.4 MB in the beginning and 818.7 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...