./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label47_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_f64e1998-bf36-4dbd-be70-41a0282ed11f/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f64e1998-bf36-4dbd-be70-41a0282ed11f/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f64e1998-bf36-4dbd-be70-41a0282ed11f/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f64e1998-bf36-4dbd-be70-41a0282ed11f/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label47_false-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f64e1998-bf36-4dbd-be70-41a0282ed11f/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f64e1998-bf36-4dbd-be70-41a0282ed11f/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 db6e7a7f3be179438223abf82c6cabe8d26d1cb7 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 01:04:49,954 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:04:49,955 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:04:49,964 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:04:49,964 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:04:49,965 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:04:49,965 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:04:49,967 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:04:49,968 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:04:49,968 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:04:49,969 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:04:49,969 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:04:49,970 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:04:49,971 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:04:49,972 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:04:49,972 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:04:49,973 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:04:49,974 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:04:49,975 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:04:49,977 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:04:49,977 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:04:49,978 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:04:49,980 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:04:49,980 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:04:49,980 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:04:49,981 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:04:49,981 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:04:49,982 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:04:49,983 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:04:49,983 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:04:49,983 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:04:49,984 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:04:49,984 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:04:49,984 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:04:49,985 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:04:49,985 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:04:49,986 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f64e1998-bf36-4dbd-be70-41a0282ed11f/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-09 01:04:49,994 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:04:49,994 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:04:49,995 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 01:04:49,995 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-09 01:04:49,995 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 01:04:49,996 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 01:04:49,996 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:04:49,996 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:04:49,996 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:04:49,996 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:04:49,996 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:04:49,997 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 01:04:49,997 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 01:04:49,997 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 01:04:49,997 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:04:49,997 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 01:04:49,997 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 01:04:49,997 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 01:04:49,998 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-09 01:04:49,998 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-09 01:04:49,998 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:04:49,998 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 01:04:49,998 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-09 01:04:49,998 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:04:49,999 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 01:04:49,999 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 01:04:49,999 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-09 01:04:49,999 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 01:04:49,999 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 01:04:49,999 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_f64e1998-bf36-4dbd-be70-41a0282ed11f/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 -> db6e7a7f3be179438223abf82c6cabe8d26d1cb7 [2018-12-09 01:04:50,023 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:04:50,031 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:04:50,033 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:04:50,034 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:04:50,034 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:04:50,035 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f64e1998-bf36-4dbd-be70-41a0282ed11f/bin-2019/ukojak/../../sv-benchmarks/c/eca-rers2012/Problem01_label47_false-unreach-call_false-termination.c [2018-12-09 01:04:50,068 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f64e1998-bf36-4dbd-be70-41a0282ed11f/bin-2019/ukojak/data/89b8df427/e2f8f5d0aa1948d98fe9b55bf3a3a6ee/FLAGa28fb64f0 [2018-12-09 01:04:50,404 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:04:50,404 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f64e1998-bf36-4dbd-be70-41a0282ed11f/sv-benchmarks/c/eca-rers2012/Problem01_label47_false-unreach-call_false-termination.c [2018-12-09 01:04:50,410 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f64e1998-bf36-4dbd-be70-41a0282ed11f/bin-2019/ukojak/data/89b8df427/e2f8f5d0aa1948d98fe9b55bf3a3a6ee/FLAGa28fb64f0 [2018-12-09 01:04:50,419 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f64e1998-bf36-4dbd-be70-41a0282ed11f/bin-2019/ukojak/data/89b8df427/e2f8f5d0aa1948d98fe9b55bf3a3a6ee [2018-12-09 01:04:50,421 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:04:50,422 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 01:04:50,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:04:50,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:04:50,424 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:04:50,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:04:50" (1/1) ... [2018-12-09 01:04:50,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54724d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:50, skipping insertion in model container [2018-12-09 01:04:50,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:04:50" (1/1) ... [2018-12-09 01:04:50,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:04:50,455 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:04:50,637 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:04:50,640 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:04:50,728 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:04:50,738 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:04:50,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:50 WrapperNode [2018-12-09 01:04:50,738 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:04:50,739 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 01:04:50,739 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 01:04:50,739 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 01:04:50,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:50" (1/1) ... [2018-12-09 01:04:50,753 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:50" (1/1) ... [2018-12-09 01:04:50,781 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 01:04:50,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:04:50,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:04:50,781 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:04:50,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:50" (1/1) ... [2018-12-09 01:04:50,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:50" (1/1) ... [2018-12-09 01:04:50,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:50" (1/1) ... [2018-12-09 01:04:50,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:50" (1/1) ... [2018-12-09 01:04:50,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:50" (1/1) ... [2018-12-09 01:04:50,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:50" (1/1) ... [2018-12-09 01:04:50,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:50" (1/1) ... [2018-12-09 01:04:50,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:04:50,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:04:50,811 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:04:50,811 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:04:50,812 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:04:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f64e1998-bf36-4dbd-be70-41a0282ed11f/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-09 01:04:50,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:04:50,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:04:51,806 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:04:51,806 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-09 01:04:51,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:04:51 BoogieIcfgContainer [2018-12-09 01:04:51,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:04:51,808 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-09 01:04:51,808 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-09 01:04:51,817 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-09 01:04:51,818 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:04:51" (1/1) ... [2018-12-09 01:04:51,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:04:51,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:51,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 76 states and 144 transitions. [2018-12-09 01:04:51,862 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 144 transitions. [2018-12-09 01:04:51,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 01:04:51,864 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:52,050 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-09 01:04:52,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:52,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 145 states and 239 transitions. [2018-12-09 01:04:52,341 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 239 transitions. [2018-12-09 01:04:52,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 01:04:52,342 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:52,449 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-09 01:04:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:52,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 146 states and 240 transitions. [2018-12-09 01:04:52,602 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 240 transitions. [2018-12-09 01:04:52,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 01:04:52,602 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:52,626 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-09 01:04:52,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:52,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 150 states and 247 transitions. [2018-12-09 01:04:52,697 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 247 transitions. [2018-12-09 01:04:52,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 01:04:52,698 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:52,730 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:04:52,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:52,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 151 states and 249 transitions. [2018-12-09 01:04:52,766 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 249 transitions. [2018-12-09 01:04:52,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 01:04:52,770 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:52,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:04:53,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:53,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 221 states and 323 transitions. [2018-12-09 01:04:53,190 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 323 transitions. [2018-12-09 01:04:53,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-09 01:04:53,191 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:53,225 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:04:53,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:53,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 228 states and 337 transitions. [2018-12-09 01:04:53,461 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 337 transitions. [2018-12-09 01:04:53,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 01:04:53,462 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:53,480 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 01:04:53,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:53,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 229 states and 338 transitions. [2018-12-09 01:04:53,511 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 338 transitions. [2018-12-09 01:04:53,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 01:04:53,512 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:53,527 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:04:53,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:53,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 232 states and 343 transitions. [2018-12-09 01:04:53,565 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 343 transitions. [2018-12-09 01:04:53,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 01:04:53,566 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:53,619 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:04:54,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:54,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 240 states and 359 transitions. [2018-12-09 01:04:54,090 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 359 transitions. [2018-12-09 01:04:54,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 01:04:54,091 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:54,134 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 01:04:54,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:54,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 245 states and 368 transitions. [2018-12-09 01:04:54,249 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 368 transitions. [2018-12-09 01:04:54,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 01:04:54,250 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:54,267 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:04:54,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 248 states and 371 transitions. [2018-12-09 01:04:54,408 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 371 transitions. [2018-12-09 01:04:54,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 01:04:54,408 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:54,420 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-09 01:04:54,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:54,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 253 states and 377 transitions. [2018-12-09 01:04:54,443 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 377 transitions. [2018-12-09 01:04:54,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 01:04:54,443 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:54,457 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:04:54,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:54,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 258 states and 385 transitions. [2018-12-09 01:04:54,566 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 385 transitions. [2018-12-09 01:04:54,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 01:04:54,567 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:54,586 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:04:54,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:54,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 259 states and 386 transitions. [2018-12-09 01:04:54,656 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 386 transitions. [2018-12-09 01:04:54,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 01:04:54,656 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:54,671 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:04:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:54,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 262 states and 389 transitions. [2018-12-09 01:04:54,750 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 389 transitions. [2018-12-09 01:04:54,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-09 01:04:54,751 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:04:55,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:55,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 276 states and 411 transitions. [2018-12-09 01:04:55,370 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 411 transitions. [2018-12-09 01:04:55,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-09 01:04:55,371 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:55,384 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:04:55,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:55,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 280 states and 418 transitions. [2018-12-09 01:04:55,529 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 418 transitions. [2018-12-09 01:04:55,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-09 01:04:55,530 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 01:04:55,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:55,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 281 states and 419 transitions. [2018-12-09 01:04:55,601 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 419 transitions. [2018-12-09 01:04:55,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-09 01:04:55,601 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:55,643 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:04:56,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:56,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 291 states and 430 transitions. [2018-12-09 01:04:56,029 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 430 transitions. [2018-12-09 01:04:56,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 01:04:56,030 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:04:56,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:56,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 292 states and 430 transitions. [2018-12-09 01:04:56,110 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 430 transitions. [2018-12-09 01:04:56,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 01:04:56,110 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:04:56,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:56,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 297 states and 435 transitions. [2018-12-09 01:04:56,157 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 435 transitions. [2018-12-09 01:04:56,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 01:04:56,157 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:56,173 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:04:56,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:56,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 307 states and 446 transitions. [2018-12-09 01:04:56,556 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 446 transitions. [2018-12-09 01:04:56,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 01:04:56,557 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:56,609 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:04:57,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:57,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 325 states and 472 transitions. [2018-12-09 01:04:57,178 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 472 transitions. [2018-12-09 01:04:57,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 01:04:57,179 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:57,197 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 01:04:57,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:57,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 329 states and 479 transitions. [2018-12-09 01:04:57,310 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 479 transitions. [2018-12-09 01:04:57,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 01:04:57,311 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:57,326 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 01:04:57,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:57,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 336 states and 489 transitions. [2018-12-09 01:04:57,441 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 489 transitions. [2018-12-09 01:04:57,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 01:04:57,442 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:57,459 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 01:04:57,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:57,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 338 states and 490 transitions. [2018-12-09 01:04:57,538 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 490 transitions. [2018-12-09 01:04:57,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 01:04:57,538 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:57,557 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 01:04:57,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:57,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 339 states and 492 transitions. [2018-12-09 01:04:57,644 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 492 transitions. [2018-12-09 01:04:57,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 01:04:57,644 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 01:04:57,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:57,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 340 states and 494 transitions. [2018-12-09 01:04:57,805 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 494 transitions. [2018-12-09 01:04:57,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-09 01:04:57,805 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:57,827 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:04:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:57,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 347 states and 503 transitions. [2018-12-09 01:04:57,968 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 503 transitions. [2018-12-09 01:04:57,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 01:04:57,968 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:57,985 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:04:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 349 states and 505 transitions. [2018-12-09 01:04:58,078 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 505 transitions. [2018-12-09 01:04:58,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-09 01:04:58,079 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:58,138 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:04:59,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:04:59,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 376 states and 541 transitions. [2018-12-09 01:04:59,088 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 541 transitions. [2018-12-09 01:04:59,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 01:04:59,089 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:04:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:04:59,169 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:00,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 398 states and 577 transitions. [2018-12-09 01:05:00,202 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 577 transitions. [2018-12-09 01:05:00,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 01:05:00,203 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:00,222 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:00,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:00,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 402 states and 580 transitions. [2018-12-09 01:05:00,345 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 580 transitions. [2018-12-09 01:05:00,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 01:05:00,345 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:00,420 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:00,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:00,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 418 states and 599 transitions. [2018-12-09 01:05:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 599 transitions. [2018-12-09 01:05:00,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-09 01:05:00,986 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:00,997 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 01:05:01,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:01,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 425 states and 608 transitions. [2018-12-09 01:05:01,146 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 608 transitions. [2018-12-09 01:05:01,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 01:05:01,147 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:01,160 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 01:05:01,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:01,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 430 states and 613 transitions. [2018-12-09 01:05:01,183 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 613 transitions. [2018-12-09 01:05:01,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 01:05:01,183 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:01,195 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 01:05:01,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:01,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 431 states and 614 transitions. [2018-12-09 01:05:01,269 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 614 transitions. [2018-12-09 01:05:01,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 01:05:01,269 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:01,285 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:01,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:01,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 434 states and 617 transitions. [2018-12-09 01:05:01,389 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 617 transitions. [2018-12-09 01:05:01,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 01:05:01,390 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:01,419 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:02,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:02,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 455 states and 642 transitions. [2018-12-09 01:05:02,153 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 642 transitions. [2018-12-09 01:05:02,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-09 01:05:02,153 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:02,176 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:02,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:02,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 466 states and 652 transitions. [2018-12-09 01:05:02,616 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 652 transitions. [2018-12-09 01:05:02,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 01:05:02,616 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:02,858 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:03,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:03,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 480 states and 673 transitions. [2018-12-09 01:05:04,000 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 673 transitions. [2018-12-09 01:05:04,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 01:05:04,001 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:04,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 490 states and 683 transitions. [2018-12-09 01:05:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 683 transitions. [2018-12-09 01:05:04,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 01:05:04,452 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:04,470 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:05:04,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:04,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 497 states and 690 transitions. [2018-12-09 01:05:04,652 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 690 transitions. [2018-12-09 01:05:04,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-09 01:05:04,653 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:04,666 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:05:04,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:04,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 504 states and 697 transitions. [2018-12-09 01:05:04,691 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 697 transitions. [2018-12-09 01:05:04,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-09 01:05:04,692 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:04,711 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:05:04,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:04,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 506 states and 701 transitions. [2018-12-09 01:05:04,797 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 701 transitions. [2018-12-09 01:05:04,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-09 01:05:04,798 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:04,812 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:05:04,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:04,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 508 states and 703 transitions. [2018-12-09 01:05:04,826 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 703 transitions. [2018-12-09 01:05:04,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-09 01:05:04,827 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:04,891 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 01:05:05,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:05,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 512 states and 709 transitions. [2018-12-09 01:05:05,267 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 709 transitions. [2018-12-09 01:05:05,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-09 01:05:05,267 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:05,413 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:06,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:06,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 542 states and 747 transitions. [2018-12-09 01:05:06,903 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 747 transitions. [2018-12-09 01:05:06,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 01:05:06,904 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:06,930 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:07,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:07,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 556 states and 768 transitions. [2018-12-09 01:05:07,476 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 768 transitions. [2018-12-09 01:05:07,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 01:05:07,476 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:07,506 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:07,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:07,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 562 states and 776 transitions. [2018-12-09 01:05:07,917 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 776 transitions. [2018-12-09 01:05:07,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 01:05:07,918 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:07,939 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:08,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 569 states and 783 transitions. [2018-12-09 01:05:08,124 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 783 transitions. [2018-12-09 01:05:08,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-09 01:05:08,124 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:08,149 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:08,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:08,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 574 states and 789 transitions. [2018-12-09 01:05:08,329 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 789 transitions. [2018-12-09 01:05:08,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 01:05:08,330 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:08,349 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:10,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 594 states and 817 transitions. [2018-12-09 01:05:10,320 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 817 transitions. [2018-12-09 01:05:10,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 01:05:10,320 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:10,339 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:10,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 605 states and 827 transitions. [2018-12-09 01:05:10,907 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 827 transitions. [2018-12-09 01:05:10,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 01:05:10,907 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:10,924 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:11,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:11,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 619 states and 843 transitions. [2018-12-09 01:05:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 843 transitions. [2018-12-09 01:05:11,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 01:05:11,309 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:11,323 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:11,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:11,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 623 states and 849 transitions. [2018-12-09 01:05:11,341 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 849 transitions. [2018-12-09 01:05:11,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 01:05:11,342 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:11,396 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:11,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 628 states and 858 transitions. [2018-12-09 01:05:11,979 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 858 transitions. [2018-12-09 01:05:11,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 01:05:11,980 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:05:12,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:12,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 631 states and 861 transitions. [2018-12-09 01:05:12,221 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 861 transitions. [2018-12-09 01:05:12,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 01:05:12,222 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:12,243 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:12,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:12,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 637 states and 870 transitions. [2018-12-09 01:05:12,722 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 870 transitions. [2018-12-09 01:05:12,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 01:05:12,723 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:12,757 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:12,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:12,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 638 states and 872 transitions. [2018-12-09 01:05:12,997 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 872 transitions. [2018-12-09 01:05:12,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 01:05:12,997 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:13,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:13,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 639 states and 874 transitions. [2018-12-09 01:05:13,254 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 874 transitions. [2018-12-09 01:05:13,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 01:05:13,254 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:13,275 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:13,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:13,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 640 states and 875 transitions. [2018-12-09 01:05:13,505 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 875 transitions. [2018-12-09 01:05:13,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 01:05:13,505 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:13,531 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:14,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 646 states and 883 transitions. [2018-12-09 01:05:14,292 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 883 transitions. [2018-12-09 01:05:14,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-09 01:05:14,293 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:14,307 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 01:05:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:14,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 655 states and 891 transitions. [2018-12-09 01:05:14,722 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 891 transitions. [2018-12-09 01:05:14,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 01:05:14,722 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:14,829 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:17,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 680 states and 932 transitions. [2018-12-09 01:05:17,291 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 932 transitions. [2018-12-09 01:05:17,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 01:05:17,292 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:17,396 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:19,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:19,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 692 states and 952 transitions. [2018-12-09 01:05:19,903 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 952 transitions. [2018-12-09 01:05:19,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-09 01:05:19,904 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:20,089 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:05:20,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:20,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 717 states and 978 transitions. [2018-12-09 01:05:20,658 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 978 transitions. [2018-12-09 01:05:20,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-09 01:05:20,658 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:21,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:21,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 728 states and 994 transitions. [2018-12-09 01:05:21,464 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 994 transitions. [2018-12-09 01:05:21,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-09 01:05:21,465 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:05:22,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:22,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 735 states and 1002 transitions. [2018-12-09 01:05:22,382 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1002 transitions. [2018-12-09 01:05:22,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-09 01:05:22,383 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:22,406 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:05:22,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:22,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 736 states and 1003 transitions. [2018-12-09 01:05:22,661 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1003 transitions. [2018-12-09 01:05:22,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-09 01:05:22,662 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:22,676 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:05:22,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:22,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 738 states and 1004 transitions. [2018-12-09 01:05:22,822 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1004 transitions. [2018-12-09 01:05:22,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-09 01:05:22,822 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:05:22,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:22,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 740 states and 1005 transitions. [2018-12-09 01:05:22,973 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1005 transitions. [2018-12-09 01:05:22,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-09 01:05:22,974 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:22,988 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:05:23,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:23,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 750 states and 1016 transitions. [2018-12-09 01:05:23,024 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1016 transitions. [2018-12-09 01:05:23,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-09 01:05:23,025 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:05:23,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:23,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 751 states and 1017 transitions. [2018-12-09 01:05:23,149 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1017 transitions. [2018-12-09 01:05:23,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-09 01:05:23,150 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:23,177 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:05:24,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:24,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 764 states and 1039 transitions. [2018-12-09 01:05:24,689 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1039 transitions. [2018-12-09 01:05:24,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-09 01:05:24,691 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:28,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:28,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 806 states and 1083 transitions. [2018-12-09 01:05:28,864 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1083 transitions. [2018-12-09 01:05:28,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 01:05:28,865 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:29,034 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 816 states and 1103 transitions. [2018-12-09 01:05:30,122 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1103 transitions. [2018-12-09 01:05:30,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 01:05:30,123 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:30,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:30,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 817 states and 1103 transitions. [2018-12-09 01:05:30,311 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1103 transitions. [2018-12-09 01:05:30,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 01:05:30,312 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:30,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:30,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 818 states and 1104 transitions. [2018-12-09 01:05:30,606 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1104 transitions. [2018-12-09 01:05:30,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-09 01:05:30,606 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:30,631 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:05:31,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:31,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 828 states and 1116 transitions. [2018-12-09 01:05:31,434 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1116 transitions. [2018-12-09 01:05:31,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-09 01:05:31,435 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:31,451 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:05:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:31,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 830 states and 1118 transitions. [2018-12-09 01:05:31,693 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1118 transitions. [2018-12-09 01:05:31,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-09 01:05:31,694 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:35,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 844 states and 1140 transitions. [2018-12-09 01:05:35,335 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1140 transitions. [2018-12-09 01:05:35,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-09 01:05:35,337 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:35,369 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:35,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 847 states and 1144 transitions. [2018-12-09 01:05:35,881 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1144 transitions. [2018-12-09 01:05:35,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-09 01:05:35,881 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:36,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:36,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 849 states and 1146 transitions. [2018-12-09 01:05:36,351 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1146 transitions. [2018-12-09 01:05:36,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-09 01:05:36,351 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:36,367 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:36,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 854 states and 1152 transitions. [2018-12-09 01:05:36,645 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1152 transitions. [2018-12-09 01:05:36,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 01:05:36,646 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:36,662 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-09 01:05:36,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:36,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 856 states and 1155 transitions. [2018-12-09 01:05:36,780 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1155 transitions. [2018-12-09 01:05:36,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 01:05:36,781 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:36,797 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-09 01:05:36,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:36,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 857 states and 1156 transitions. [2018-12-09 01:05:36,811 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1156 transitions. [2018-12-09 01:05:36,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 01:05:36,811 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:36,831 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:05:39,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 895 states and 1201 transitions. [2018-12-09 01:05:39,597 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1201 transitions. [2018-12-09 01:05:39,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 01:05:39,597 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:39,620 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:05:40,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:40,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 906 states and 1211 transitions. [2018-12-09 01:05:40,210 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1211 transitions. [2018-12-09 01:05:40,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 01:05:40,211 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:40,237 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:05:41,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:41,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 950 states and 1257 transitions. [2018-12-09 01:05:41,001 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1257 transitions. [2018-12-09 01:05:41,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 01:05:41,002 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:41,023 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:05:41,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:41,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 953 states and 1260 transitions. [2018-12-09 01:05:41,709 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1260 transitions. [2018-12-09 01:05:41,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 01:05:41,710 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:41,726 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-09 01:05:41,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 954 states and 1260 transitions. [2018-12-09 01:05:41,858 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1260 transitions. [2018-12-09 01:05:41,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 01:05:41,859 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:41,878 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:05:42,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:42,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 955 states and 1260 transitions. [2018-12-09 01:05:42,056 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1260 transitions. [2018-12-09 01:05:42,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 01:05:42,057 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:42,076 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:05:42,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 956 states and 1260 transitions. [2018-12-09 01:05:42,130 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1260 transitions. [2018-12-09 01:05:42,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-09 01:05:42,131 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:42,415 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 01:05:46,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:46,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 975 states and 1290 transitions. [2018-12-09 01:05:46,196 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1290 transitions. [2018-12-09 01:05:46,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-09 01:05:46,197 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:46,213 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 01:05:46,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:46,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 977 states and 1293 transitions. [2018-12-09 01:05:46,549 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1293 transitions. [2018-12-09 01:05:46,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-09 01:05:46,549 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:46,565 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 01:05:47,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:47,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 990 states and 1314 transitions. [2018-12-09 01:05:47,679 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1314 transitions. [2018-12-09 01:05:47,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-09 01:05:47,680 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 01:05:48,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:48,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 992 states and 1317 transitions. [2018-12-09 01:05:48,806 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1317 transitions. [2018-12-09 01:05:48,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-09 01:05:48,807 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:48,823 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 01:05:48,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:48,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 993 states and 1317 transitions. [2018-12-09 01:05:48,839 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1317 transitions. [2018-12-09 01:05:48,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-09 01:05:48,839 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:48,997 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:50,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:50,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1063 states and 1391 transitions. [2018-12-09 01:05:50,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1391 transitions. [2018-12-09 01:05:50,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-09 01:05:50,047 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:51,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:51,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1086 states and 1417 transitions. [2018-12-09 01:05:51,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1417 transitions. [2018-12-09 01:05:51,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-09 01:05:51,134 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:51,160 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:51,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:51,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1087 states and 1418 transitions. [2018-12-09 01:05:51,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1418 transitions. [2018-12-09 01:05:51,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-09 01:05:51,327 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:51,354 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:05:51,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1089 states and 1419 transitions. [2018-12-09 01:05:51,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1419 transitions. [2018-12-09 01:05:51,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-09 01:05:51,540 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:51,557 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 01:05:51,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:51,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1091 states and 1420 transitions. [2018-12-09 01:05:51,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1420 transitions. [2018-12-09 01:05:51,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-09 01:05:51,884 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:51,901 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 01:05:52,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1092 states and 1420 transitions. [2018-12-09 01:05:52,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1420 transitions. [2018-12-09 01:05:52,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-09 01:05:52,077 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:52,136 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:05:52,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:52,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1103 states and 1434 transitions. [2018-12-09 01:05:52,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1434 transitions. [2018-12-09 01:05:52,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-09 01:05:52,849 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:53,196 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 95 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:05:56,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:56,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1118 states and 1454 transitions. [2018-12-09 01:05:56,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1454 transitions. [2018-12-09 01:05:56,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-09 01:05:56,909 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:56,977 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:05:56,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:05:56,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1119 states and 1455 transitions. [2018-12-09 01:05:56,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1455 transitions. [2018-12-09 01:05:56,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-09 01:05:56,995 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:05:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:05:59,318 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:06:03,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:03,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1186 states and 1527 transitions. [2018-12-09 01:06:03,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1527 transitions. [2018-12-09 01:06:03,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-09 01:06:03,498 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:03,522 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-09 01:06:07,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:07,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1206 states and 1556 transitions. [2018-12-09 01:06:07,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1556 transitions. [2018-12-09 01:06:07,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-09 01:06:07,480 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:08,629 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:06:17,177 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 31 [2018-12-09 01:06:18,422 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2018-12-09 01:06:19,923 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2018-12-09 01:06:21,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1319 states and 1683 transitions. [2018-12-09 01:06:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1683 transitions. [2018-12-09 01:06:21,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-09 01:06:21,821 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:21,884 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 01:06:22,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:22,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1324 states and 1690 transitions. [2018-12-09 01:06:22,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1690 transitions. [2018-12-09 01:06:22,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-09 01:06:22,415 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:22,486 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 01:06:22,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:22,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1330 states and 1695 transitions. [2018-12-09 01:06:22,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1695 transitions. [2018-12-09 01:06:22,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-09 01:06:22,775 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:22,807 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-12-09 01:06:24,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:24,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1355 states and 1725 transitions. [2018-12-09 01:06:24,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1725 transitions. [2018-12-09 01:06:24,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-09 01:06:24,787 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:24,811 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-09 01:06:24,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:24,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1366 states and 1737 transitions. [2018-12-09 01:06:24,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1737 transitions. [2018-12-09 01:06:24,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-09 01:06:24,858 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:24,917 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-09 01:06:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:30,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1387 states and 1764 transitions. [2018-12-09 01:06:30,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 1764 transitions. [2018-12-09 01:06:30,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-09 01:06:30,773 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-09 01:06:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:31,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1392 states and 1769 transitions. [2018-12-09 01:06:31,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1769 transitions. [2018-12-09 01:06:31,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-09 01:06:31,180 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:31,800 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 109 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:06:37,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:37,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1421 states and 1806 transitions. [2018-12-09 01:06:37,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1806 transitions. [2018-12-09 01:06:37,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-09 01:06:37,072 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:37,115 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 109 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:06:38,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:38,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1431 states and 1815 transitions. [2018-12-09 01:06:38,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1815 transitions. [2018-12-09 01:06:38,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-09 01:06:38,616 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:38,641 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-09 01:06:38,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:38,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1432 states and 1816 transitions. [2018-12-09 01:06:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1816 transitions. [2018-12-09 01:06:38,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-09 01:06:38,664 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:38,685 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-09 01:06:38,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:38,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1433 states and 1818 transitions. [2018-12-09 01:06:38,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1818 transitions. [2018-12-09 01:06:38,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-09 01:06:38,711 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:38,782 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-09 01:06:39,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:39,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1437 states and 1823 transitions. [2018-12-09 01:06:39,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1823 transitions. [2018-12-09 01:06:39,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-09 01:06:39,163 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:06:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:40,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1454 states and 1845 transitions. [2018-12-09 01:06:40,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1845 transitions. [2018-12-09 01:06:40,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-09 01:06:40,644 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:40,914 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:06:41,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:41,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1460 states and 1852 transitions. [2018-12-09 01:06:41,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 1852 transitions. [2018-12-09 01:06:41,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-09 01:06:41,752 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:41,803 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:06:42,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:42,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1525 states and 1916 transitions. [2018-12-09 01:06:42,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1916 transitions. [2018-12-09 01:06:42,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-09 01:06:42,706 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:42,729 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:06:44,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:44,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1533 states and 1929 transitions. [2018-12-09 01:06:44,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1929 transitions. [2018-12-09 01:06:44,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-09 01:06:44,407 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 01:06:45,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:45,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1539 states and 1940 transitions. [2018-12-09 01:06:45,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 1940 transitions. [2018-12-09 01:06:45,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-09 01:06:45,374 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:45,408 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 01:06:45,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:45,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1542 states and 1944 transitions. [2018-12-09 01:06:45,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 1944 transitions. [2018-12-09 01:06:45,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-09 01:06:45,765 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:45,799 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:06:48,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:48,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1563 states and 1970 transitions. [2018-12-09 01:06:48,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1970 transitions. [2018-12-09 01:06:48,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-09 01:06:48,950 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:48,999 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 01:06:49,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:49,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1565 states and 1972 transitions. [2018-12-09 01:06:49,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 1972 transitions. [2018-12-09 01:06:49,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-09 01:06:49,476 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:06:49,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:49,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1566 states and 1972 transitions. [2018-12-09 01:06:49,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 1972 transitions. [2018-12-09 01:06:49,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-09 01:06:49,942 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:49,965 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-09 01:06:50,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:50,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1980 states to 1573 states and 1980 transitions. [2018-12-09 01:06:50,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1980 transitions. [2018-12-09 01:06:50,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-09 01:06:50,342 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:50,365 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-09 01:06:50,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:50,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1575 states and 1981 transitions. [2018-12-09 01:06:50,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 1981 transitions. [2018-12-09 01:06:50,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-09 01:06:50,816 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:51,147 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-09 01:06:51,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:51,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1988 states to 1580 states and 1988 transitions. [2018-12-09 01:06:51,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 1988 transitions. [2018-12-09 01:06:51,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-09 01:06:51,850 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:06:52,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:52,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 1590 states and 2003 transitions. [2018-12-09 01:06:52,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2003 transitions. [2018-12-09 01:06:52,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-09 01:06:52,986 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:53,889 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 98 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:06:56,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:06:56,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 1601 states and 2016 transitions. [2018-12-09 01:06:56,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2016 transitions. [2018-12-09 01:06:56,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-09 01:06:56,556 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:06:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:06:56,604 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:07:01,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:07:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 1617 states and 2042 transitions. [2018-12-09 01:07:01,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2042 transitions. [2018-12-09 01:07:01,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-09 01:07:01,930 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:07:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:01,961 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:07:07,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:07:07,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 1629 states and 2064 transitions. [2018-12-09 01:07:07,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2064 transitions. [2018-12-09 01:07:07,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-09 01:07:07,631 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:07:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:07:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:07:08,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 1633 states and 2068 transitions. [2018-12-09 01:07:08,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2068 transitions. [2018-12-09 01:07:08,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-09 01:07:08,365 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:07:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:08,390 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-09 01:07:08,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:07:08,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 1638 states and 2076 transitions. [2018-12-09 01:07:08,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2076 transitions. [2018-12-09 01:07:08,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-09 01:07:08,890 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:07:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-09 01:07:12,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:07:12,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 1657 states and 2103 transitions. [2018-12-09 01:07:12,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2103 transitions. [2018-12-09 01:07:12,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-09 01:07:12,792 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:07:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:12,823 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-09 01:07:13,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:07:13,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2104 states to 1659 states and 2104 transitions. [2018-12-09 01:07:13,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2104 transitions. [2018-12-09 01:07:13,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-09 01:07:13,093 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:07:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:13,119 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-09 01:07:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:07:13,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 1664 states and 2111 transitions. [2018-12-09 01:07:13,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2111 transitions. [2018-12-09 01:07:13,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-09 01:07:13,975 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:07:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:14,151 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-09 01:07:15,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:07:15,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 1669 states and 2124 transitions. [2018-12-09 01:07:15,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2124 transitions. [2018-12-09 01:07:15,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-09 01:07:15,138 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:07:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:15,163 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:07:15,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:07:15,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 1676 states and 2132 transitions. [2018-12-09 01:07:15,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2132 transitions. [2018-12-09 01:07:15,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-09 01:07:15,882 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:07:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-09 01:07:17,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:07:17,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2162 states to 1706 states and 2162 transitions. [2018-12-09 01:07:17,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2162 transitions. [2018-12-09 01:07:17,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-09 01:07:17,055 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:07:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-09 01:07:17,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:07:17,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2166 states to 1709 states and 2166 transitions. [2018-12-09 01:07:17,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2166 transitions. [2018-12-09 01:07:17,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-09 01:07:17,733 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:07:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-09 01:07:18,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:07:18,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 1717 states and 2174 transitions. [2018-12-09 01:07:18,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2174 transitions. [2018-12-09 01:07:18,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-09 01:07:18,467 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:07:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:18,503 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-09 01:07:18,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:07:18,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2175 states to 1718 states and 2175 transitions. [2018-12-09 01:07:18,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2175 transitions. [2018-12-09 01:07:18,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-09 01:07:18,980 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:07:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:19,006 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-09 01:07:19,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:07:19,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2194 states to 1737 states and 2194 transitions. [2018-12-09 01:07:19,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2194 transitions. [2018-12-09 01:07:19,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-09 01:07:19,235 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:07:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:19,259 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-09 01:07:21,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:07:21,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 1747 states and 2215 transitions. [2018-12-09 01:07:21,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1747 states and 2215 transitions. [2018-12-09 01:07:21,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-09 01:07:21,957 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:07:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:21,987 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-09 01:07:23,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:07:23,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 1749 states and 2216 transitions. [2018-12-09 01:07:23,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2216 transitions. [2018-12-09 01:07:23,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-09 01:07:23,632 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:07:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:23,661 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-09 01:07:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:07:24,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 1750 states and 2216 transitions. [2018-12-09 01:07:24,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2216 transitions. [2018-12-09 01:07:24,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-09 01:07:24,157 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:07:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:24,185 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 01:07:25,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:07:25,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 1763 states and 2230 transitions. [2018-12-09 01:07:25,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2230 transitions. [2018-12-09 01:07:25,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-09 01:07:25,743 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:07:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:25,769 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 01:07:26,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:07:26,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 1770 states and 2236 transitions. [2018-12-09 01:07:26,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2236 transitions. [2018-12-09 01:07:26,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-09 01:07:26,441 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:07:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:26,467 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 01:07:32,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:07:32,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 1788 states and 2257 transitions. [2018-12-09 01:07:32,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2257 transitions. [2018-12-09 01:07:32,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-09 01:07:32,403 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:07:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:32,458 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-09 01:07:41,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:07:41,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2288 states to 1813 states and 2288 transitions. [2018-12-09 01:07:41,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2288 transitions. [2018-12-09 01:07:41,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-09 01:07:41,024 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:07:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:41,133 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-12-09 01:07:46,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:07:46,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 1821 states and 2305 transitions. [2018-12-09 01:07:46,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2305 transitions. [2018-12-09 01:07:46,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-09 01:07:46,270 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:07:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-12-09 01:07:47,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:07:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 1823 states and 2307 transitions. [2018-12-09 01:07:47,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 2307 transitions. [2018-12-09 01:07:47,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-09 01:07:47,198 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:07:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:47,265 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-09 01:07:48,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:07:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 1831 states and 2316 transitions. [2018-12-09 01:07:48,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2316 transitions. [2018-12-09 01:07:48,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-09 01:07:48,491 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:07:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:48,570 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-09 01:07:50,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:07:50,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 1841 states and 2327 transitions. [2018-12-09 01:07:50,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2327 transitions. [2018-12-09 01:07:50,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-09 01:07:50,339 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:07:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:50,384 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 193 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-09 01:07:51,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:07:51,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 1846 states and 2333 transitions. [2018-12-09 01:07:51,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2333 transitions. [2018-12-09 01:07:51,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-09 01:07:51,256 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:07:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:07:54,053 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 01:07:55,517 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-12-09 01:08:05,762 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2018-12-09 01:08:07,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:08:07,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2373 states to 1883 states and 2373 transitions. [2018-12-09 01:08:07,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 2373 transitions. [2018-12-09 01:08:07,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-09 01:08:07,042 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:08:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:08:07,204 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 01:08:09,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:08:09,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 1895 states and 2384 transitions. [2018-12-09 01:08:09,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2384 transitions. [2018-12-09 01:08:09,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-09 01:08:09,928 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:08:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:08:10,030 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 01:08:10,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:08:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 1900 states and 2389 transitions. [2018-12-09 01:08:10,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2389 transitions. [2018-12-09 01:08:10,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-09 01:08:10,889 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:08:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:08:10,915 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:08:11,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:08:11,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 1906 states and 2393 transitions. [2018-12-09 01:08:11,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 2393 transitions. [2018-12-09 01:08:11,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-09 01:08:11,631 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:08:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:08:11,660 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2018-12-09 01:08:12,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:08:12,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2425 states to 1934 states and 2425 transitions. [2018-12-09 01:08:12,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 2425 transitions. [2018-12-09 01:08:12,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-09 01:08:12,895 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:08:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:08:12,924 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:08:13,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:08:13,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 1939 states and 2432 transitions. [2018-12-09 01:08:13,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2432 transitions. [2018-12-09 01:08:13,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-09 01:08:13,715 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:08:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:08:14,348 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 170 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:08:21,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:08:21,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2494 states to 1993 states and 2494 transitions. [2018-12-09 01:08:21,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 2494 transitions. [2018-12-09 01:08:21,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-09 01:08:21,215 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:08:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:08:21,249 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 01:08:23,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:08:23,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2005 states and 2514 transitions. [2018-12-09 01:08:23,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 2514 transitions. [2018-12-09 01:08:23,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-09 01:08:23,141 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:08:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:08:23,171 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 01:08:23,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:08:23,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2010 states and 2519 transitions. [2018-12-09 01:08:23,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 2519 transitions. [2018-12-09 01:08:23,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-09 01:08:23,658 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:08:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:08:23,689 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 01:08:27,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:08:27,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2530 states to 2020 states and 2530 transitions. [2018-12-09 01:08:27,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2530 transitions. [2018-12-09 01:08:27,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-09 01:08:27,005 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:08:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:08:27,037 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 01:08:30,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:08:30,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2027 states and 2536 transitions. [2018-12-09 01:08:30,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2536 transitions. [2018-12-09 01:08:30,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-09 01:08:30,889 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:08:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:08:32,965 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:08:36,524 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2018-12-09 01:08:38,282 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2018-12-09 01:08:40,140 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2018-12-09 01:08:40,607 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2018-12-09 01:08:42,734 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2018-12-09 01:08:45,676 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2018-12-09 01:08:48,264 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2018-12-09 01:08:53,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:08:53,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2072 states and 2586 transitions. [2018-12-09 01:08:53,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2586 transitions. [2018-12-09 01:08:53,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-09 01:08:53,650 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:08:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:08:53,761 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:08:54,132 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2018-12-09 01:08:58,337 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2018-12-09 01:09:00,434 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2018-12-09 01:09:01,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:01,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2082 states and 2594 transitions. [2018-12-09 01:09:01,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2594 transitions. [2018-12-09 01:09:01,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-09 01:09:01,039 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:01,157 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 01:09:01,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:01,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2599 states to 2087 states and 2599 transitions. [2018-12-09 01:09:01,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 2599 transitions. [2018-12-09 01:09:01,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-09 01:09:01,627 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:01,663 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-12-09 01:09:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:10,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2110 states and 2628 transitions. [2018-12-09 01:09:10,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 2628 transitions. [2018-12-09 01:09:10,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-09 01:09:10,771 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:11,060 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-09 01:09:19,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:19,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2703 states to 2180 states and 2703 transitions. [2018-12-09 01:09:19,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 2703 transitions. [2018-12-09 01:09:19,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-09 01:09:19,224 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:21,537 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 01:09:28,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:28,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2190 states and 2714 transitions. [2018-12-09 01:09:28,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 2714 transitions. [2018-12-09 01:09:28,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-09 01:09:28,565 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:28,698 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 01:09:29,187 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-12-09 01:09:29,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:29,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2193 states and 2718 transitions. [2018-12-09 01:09:29,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 2718 transitions. [2018-12-09 01:09:29,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-09 01:09:29,638 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:29,703 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 116 proven. 4 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-09 01:09:30,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:30,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2194 states and 2722 transitions. [2018-12-09 01:09:30,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2194 states and 2722 transitions. [2018-12-09 01:09:30,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-09 01:09:30,780 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:32,839 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 01:09:35,680 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2018-12-09 01:09:37,125 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2018-12-09 01:09:39,086 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2018-12-09 01:09:42,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:42,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2740 states to 2208 states and 2740 transitions. [2018-12-09 01:09:42,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 2740 transitions. [2018-12-09 01:09:42,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-09 01:09:42,562 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:42,669 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 01:09:45,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:45,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2765 states to 2233 states and 2765 transitions. [2018-12-09 01:09:45,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 2765 transitions. [2018-12-09 01:09:45,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-09 01:09:45,284 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:45,386 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 01:09:45,759 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2018-12-09 01:09:48,684 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2018-12-09 01:09:51,443 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2018-12-09 01:09:52,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:52,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2776 states to 2244 states and 2776 transitions. [2018-12-09 01:09:52,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 2776 transitions. [2018-12-09 01:09:52,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-09 01:09:52,083 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:52,192 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 01:09:52,865 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 22 [2018-12-09 01:09:55,246 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2018-12-09 01:09:56,610 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-12-09 01:09:57,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:57,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2787 states to 2256 states and 2787 transitions. [2018-12-09 01:09:57,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 2787 transitions. [2018-12-09 01:09:57,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-09 01:09:57,145 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:57,248 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 01:09:58,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:09:58,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2261 states and 2791 transitions. [2018-12-09 01:09:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 2791 transitions. [2018-12-09 01:09:58,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-09 01:09:58,933 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:09:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:09:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-12-09 01:10:04,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:04,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2286 states and 2827 transitions. [2018-12-09 01:10:04,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2286 states and 2827 transitions. [2018-12-09 01:10:04,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-09 01:10:04,252 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:04,296 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-12-09 01:10:04,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:04,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2835 states to 2295 states and 2835 transitions. [2018-12-09 01:10:04,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 2835 transitions. [2018-12-09 01:10:04,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-09 01:10:04,669 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:04,709 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-12-09 01:10:08,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:08,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2299 states and 2840 transitions. [2018-12-09 01:10:08,201 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 2840 transitions. [2018-12-09 01:10:08,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-09 01:10:08,202 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-12-09 01:10:10,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:10,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2301 states and 2841 transitions. [2018-12-09 01:10:10,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 2841 transitions. [2018-12-09 01:10:10,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-09 01:10:10,778 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:10,819 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-12-09 01:10:11,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:11,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2842 states to 2302 states and 2842 transitions. [2018-12-09 01:10:11,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 2842 transitions. [2018-12-09 01:10:11,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-09 01:10:11,447 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:11,487 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-12-09 01:10:11,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:11,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2843 states to 2304 states and 2843 transitions. [2018-12-09 01:10:11,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 2843 transitions. [2018-12-09 01:10:11,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-12-09 01:10:11,531 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:11,571 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-12-09 01:10:12,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2843 states to 2305 states and 2843 transitions. [2018-12-09 01:10:12,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 2843 transitions. [2018-12-09 01:10:12,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-09 01:10:12,449 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:12,564 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-09 01:10:16,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:16,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2345 states and 2882 transitions. [2018-12-09 01:10:16,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 2882 transitions. [2018-12-09 01:10:16,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-09 01:10:16,333 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:16,382 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-09 01:10:18,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:18,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2899 states to 2360 states and 2899 transitions. [2018-12-09 01:10:18,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 2899 transitions. [2018-12-09 01:10:18,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-09 01:10:18,670 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-09 01:10:24,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:24,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2379 states and 2923 transitions. [2018-12-09 01:10:24,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 2923 transitions. [2018-12-09 01:10:24,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-09 01:10:24,572 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-09 01:10:29,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:29,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2938 states to 2392 states and 2938 transitions. [2018-12-09 01:10:29,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 2938 transitions. [2018-12-09 01:10:29,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-09 01:10:29,840 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:29,957 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-09 01:10:30,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:30,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2939 states to 2394 states and 2939 transitions. [2018-12-09 01:10:30,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 2939 transitions. [2018-12-09 01:10:30,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-09 01:10:30,589 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:30,640 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-09 01:10:33,719 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2018-12-09 01:10:34,220 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-12-09 01:10:37,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2961 states to 2413 states and 2961 transitions. [2018-12-09 01:10:37,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 2961 transitions. [2018-12-09 01:10:37,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-09 01:10:37,344 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:37,402 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-09 01:10:39,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2964 states to 2416 states and 2964 transitions. [2018-12-09 01:10:39,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 2964 transitions. [2018-12-09 01:10:39,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-09 01:10:39,140 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:39,188 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-09 01:10:40,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:40,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2967 states to 2418 states and 2967 transitions. [2018-12-09 01:10:40,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 2967 transitions. [2018-12-09 01:10:40,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-09 01:10:40,017 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:40,070 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-09 01:10:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:40,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2420 states and 2968 transitions. [2018-12-09 01:10:40,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 2968 transitions. [2018-12-09 01:10:40,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-09 01:10:40,689 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-12-09 01:10:41,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:41,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2424 states and 2971 transitions. [2018-12-09 01:10:41,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 2971 transitions. [2018-12-09 01:10:41,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-09 01:10:41,805 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:41,893 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-09 01:10:43,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:43,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2428 states and 2976 transitions. [2018-12-09 01:10:43,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 2976 transitions. [2018-12-09 01:10:43,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-09 01:10:43,117 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:43,866 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 278 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-12-09 01:10:52,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:52,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2998 states to 2439 states and 2998 transitions. [2018-12-09 01:10:52,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2439 states and 2998 transitions. [2018-12-09 01:10:52,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-09 01:10:52,688 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 250 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-09 01:10:55,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:55,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 2443 states and 3004 transitions. [2018-12-09 01:10:55,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 3004 transitions. [2018-12-09 01:10:55,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-09 01:10:55,271 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:55,362 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 250 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-09 01:10:59,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:10:59,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 2445 states and 3008 transitions. [2018-12-09 01:10:59,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 3008 transitions. [2018-12-09 01:10:59,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-09 01:10:59,385 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:10:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:10:59,475 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 250 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-09 01:11:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:00,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 2446 states and 3008 transitions. [2018-12-09 01:11:00,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 3008 transitions. [2018-12-09 01:11:00,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-12-09 01:11:00,480 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:00,519 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-09 01:11:01,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:01,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 2455 states and 3018 transitions. [2018-12-09 01:11:01,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2455 states and 3018 transitions. [2018-12-09 01:11:01,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-12-09 01:11:01,736 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:01,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:01,867 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-09 01:11:02,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3027 states to 2465 states and 3027 transitions. [2018-12-09 01:11:02,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3027 transitions. [2018-12-09 01:11:02,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-12-09 01:11:02,447 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 71 proven. 187 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-09 01:11:07,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:07,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3052 states to 2480 states and 3052 transitions. [2018-12-09 01:11:07,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 3052 transitions. [2018-12-09 01:11:07,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-12-09 01:11:07,852 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:07,902 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-09 01:11:11,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:11,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3088 states to 2509 states and 3088 transitions. [2018-12-09 01:11:11,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 3088 transitions. [2018-12-09 01:11:11,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-12-09 01:11:11,485 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-09 01:11:12,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:12,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3091 states to 2515 states and 3091 transitions. [2018-12-09 01:11:12,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states and 3091 transitions. [2018-12-09 01:11:12,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-12-09 01:11:12,190 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:12,239 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-09 01:11:12,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:12,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3097 states to 2522 states and 3097 transitions. [2018-12-09 01:11:12,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 3097 transitions. [2018-12-09 01:11:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-12-09 01:11:12,290 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:14,772 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-09 01:11:29,403 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-12-09 01:11:36,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:36,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3165 states to 2563 states and 3165 transitions. [2018-12-09 01:11:36,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 3165 transitions. [2018-12-09 01:11:36,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-12-09 01:11:36,978 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:37,052 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-09 01:11:45,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:45,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 2580 states and 3188 transitions. [2018-12-09 01:11:45,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 3188 transitions. [2018-12-09 01:11:45,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-12-09 01:11:45,999 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:46,074 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-09 01:11:47,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:47,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 2581 states and 3188 transitions. [2018-12-09 01:11:47,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2581 states and 3188 transitions. [2018-12-09 01:11:47,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-12-09 01:11:47,228 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:47,320 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-09 01:11:50,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 2587 states and 3193 transitions. [2018-12-09 01:11:50,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2587 states and 3193 transitions. [2018-12-09 01:11:50,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-09 01:11:50,144 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:50,258 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-12-09 01:11:56,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:11:56,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3277 states to 2638 states and 3277 transitions. [2018-12-09 01:11:56,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2638 states and 3277 transitions. [2018-12-09 01:11:56,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-09 01:11:56,947 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:11:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:11:57,055 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-12-09 01:12:01,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:12:01,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3292 states to 2655 states and 3292 transitions. [2018-12-09 01:12:01,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 3292 transitions. [2018-12-09 01:12:01,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-09 01:12:01,393 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:12:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:01,493 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-12-09 01:12:04,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:12:04,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3310 states to 2663 states and 3310 transitions. [2018-12-09 01:12:04,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 3310 transitions. [2018-12-09 01:12:04,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-09 01:12:04,221 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:12:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-12-09 01:12:07,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:12:07,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3328 states to 2675 states and 3328 transitions. [2018-12-09 01:12:07,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 3328 transitions. [2018-12-09 01:12:07,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-09 01:12:07,080 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:12:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:07,180 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-12-09 01:12:07,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:12:07,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 2679 states and 3332 transitions. [2018-12-09 01:12:07,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2679 states and 3332 transitions. [2018-12-09 01:12:07,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-09 01:12:07,857 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:12:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:07,970 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-12-09 01:12:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:12:09,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 2680 states and 3332 transitions. [2018-12-09 01:12:09,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2680 states and 3332 transitions. [2018-12-09 01:12:09,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-09 01:12:09,937 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:12:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:10,037 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-12-09 01:12:11,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:12:11,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 2684 states and 3336 transitions. [2018-12-09 01:12:11,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 3336 transitions. [2018-12-09 01:12:11,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-09 01:12:11,368 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:12:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:11,484 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-12-09 01:12:18,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:12:18,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3372 states to 2719 states and 3372 transitions. [2018-12-09 01:12:18,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 3372 transitions. [2018-12-09 01:12:18,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-09 01:12:18,196 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:12:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:18,313 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 168 proven. 4 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-12-09 01:12:21,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:12:21,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3374 states to 2720 states and 3374 transitions. [2018-12-09 01:12:21,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2720 states and 3374 transitions. [2018-12-09 01:12:21,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-12-09 01:12:21,004 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:12:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:22,329 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 33 [2018-12-09 01:12:23,299 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-12-09 01:12:25,492 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-12-09 01:12:29,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:12:29,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 2740 states and 3396 transitions. [2018-12-09 01:12:29,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2740 states and 3396 transitions. [2018-12-09 01:12:29,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-12-09 01:12:29,432 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:12:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:31,328 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 375 proven. 55 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-09 01:12:32,314 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2018-12-09 01:12:36,016 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-12-09 01:12:37,611 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2018-12-09 01:12:43,606 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-12-09 01:12:53,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:12:53,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 2779 states and 3451 transitions. [2018-12-09 01:12:53,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 3451 transitions. [2018-12-09 01:12:53,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-12-09 01:12:53,934 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:12:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:53,988 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-09 01:12:55,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:12:55,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3463 states to 2791 states and 3463 transitions. [2018-12-09 01:12:55,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 3463 transitions. [2018-12-09 01:12:55,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-12-09 01:12:55,697 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:12:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:55,749 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-09 01:12:57,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:12:57,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3475 states to 2803 states and 3475 transitions. [2018-12-09 01:12:57,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2803 states and 3475 transitions. [2018-12-09 01:12:57,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-12-09 01:12:57,759 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:12:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:12:57,814 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-09 01:13:03,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:13:03,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3499 states to 2826 states and 3499 transitions. [2018-12-09 01:13:03,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 3499 transitions. [2018-12-09 01:13:03,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-12-09 01:13:03,314 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:13:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:13:03,366 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-09 01:13:07,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:13:07,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3513 states to 2841 states and 3513 transitions. [2018-12-09 01:13:07,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 3513 transitions. [2018-12-09 01:13:07,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-12-09 01:13:07,027 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:13:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:13:07,079 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-09 01:13:07,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:13:07,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 2843 states and 3514 transitions. [2018-12-09 01:13:07,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2843 states and 3514 transitions. [2018-12-09 01:13:07,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-12-09 01:13:07,817 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:13:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:13:07,869 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-12-09 01:13:09,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:13:09,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3519 states to 2848 states and 3519 transitions. [2018-12-09 01:13:09,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 3519 transitions. [2018-12-09 01:13:09,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-12-09 01:13:09,560 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:13:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:13:09,651 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-09 01:13:15,174 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 31 [2018-12-09 01:13:16,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:13:16,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3534 states to 2854 states and 3534 transitions. [2018-12-09 01:13:16,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 3534 transitions. [2018-12-09 01:13:16,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-12-09 01:13:16,708 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:13:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:13:16,761 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-12-09 01:13:29,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:13:29,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3566 states to 2882 states and 3566 transitions. [2018-12-09 01:13:29,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2882 states and 3566 transitions. [2018-12-09 01:13:29,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-12-09 01:13:29,461 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:13:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:13:29,615 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-12-09 01:13:34,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:13:34,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3575 states to 2887 states and 3575 transitions. [2018-12-09 01:13:34,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2887 states and 3575 transitions. [2018-12-09 01:13:34,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-12-09 01:13:34,998 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:13:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:13:35,052 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-12-09 01:13:36,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:13:36,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 2905 states and 3592 transitions. [2018-12-09 01:13:36,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 3592 transitions. [2018-12-09 01:13:36,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-12-09 01:13:36,888 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:13:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:13:36,941 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-12-09 01:13:37,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:13:37,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 2906 states and 3592 transitions. [2018-12-09 01:13:37,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2906 states and 3592 transitions. [2018-12-09 01:13:37,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-12-09 01:13:37,817 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:13:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:13:37,869 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-12-09 01:13:38,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:13:38,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 2907 states and 3592 transitions. [2018-12-09 01:13:38,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2907 states and 3592 transitions. [2018-12-09 01:13:38,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-12-09 01:13:38,348 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:13:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:13:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-12-09 01:13:39,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:13:39,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 2908 states and 3592 transitions. [2018-12-09 01:13:39,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2908 states and 3592 transitions. [2018-12-09 01:13:39,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-12-09 01:13:39,318 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:13:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:13:39,374 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-12-09 01:13:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:13:41,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3598 states to 2915 states and 3598 transitions. [2018-12-09 01:13:41,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 3598 transitions. [2018-12-09 01:13:41,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-12-09 01:13:41,315 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:13:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:13:41,433 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 192 proven. 8 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-12-09 01:14:07,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:14:07,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3685 states to 2987 states and 3685 transitions. [2018-12-09 01:14:07,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2987 states and 3685 transitions. [2018-12-09 01:14:07,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-12-09 01:14:07,977 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:14:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:14:08,082 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 192 proven. 8 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-12-09 01:14:13,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:14:13,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3700 states to 3003 states and 3700 transitions. [2018-12-09 01:14:13,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3003 states and 3700 transitions. [2018-12-09 01:14:13,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-12-09 01:14:13,439 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:14:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:14:15,307 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 192 proven. 8 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-12-09 01:14:18,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:14:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3705 states to 3007 states and 3705 transitions. [2018-12-09 01:14:18,037 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 3705 transitions. [2018-12-09 01:14:18,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-12-09 01:14:18,038 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:14:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:14:18,160 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 192 proven. 8 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-12-09 01:14:18,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:14:18,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3709 states to 3011 states and 3709 transitions. [2018-12-09 01:14:18,245 INFO L276 IsEmpty]: Start isEmpty. Operand 3011 states and 3709 transitions. [2018-12-09 01:14:18,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-12-09 01:14:18,246 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:14:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:14:18,369 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 192 proven. 8 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2018-12-09 01:14:23,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 01:14:23,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3728 states to 3030 states and 3728 transitions. [2018-12-09 01:14:23,380 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3728 transitions. [2018-12-09 01:14:23,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-12-09 01:14:23,382 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 01:14:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:14:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:14:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:14:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 01:14:23,668 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 249 iterations. [2018-12-09 01:14:23,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.12 01:14:23 ImpRootNode [2018-12-09 01:14:23,779 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-09 01:14:23,779 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 01:14:23,779 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 01:14:23,780 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 01:14:23,780 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:04:51" (3/4) ... [2018-12-09 01:14:23,782 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 01:14:23,870 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f64e1998-bf36-4dbd-be70-41a0282ed11f/bin-2019/ukojak/witness.graphml [2018-12-09 01:14:23,870 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 01:14:23,870 INFO L168 Benchmark]: Toolchain (without parser) took 573449.36 ms. Allocated memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: 2.3 GB). Free memory was 950.6 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 872.8 MB. Max. memory is 11.5 GB. [2018-12-09 01:14:23,871 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:14:23,871 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 74.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -101.3 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. [2018-12-09 01:14:23,871 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2018-12-09 01:14:23,871 INFO L168 Benchmark]: Boogie Preprocessor took 29.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 11.5 GB. [2018-12-09 01:14:23,871 INFO L168 Benchmark]: RCFGBuilder took 996.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 823.1 MB in the end (delta: 217.8 MB). Peak memory consumption was 217.8 MB. Max. memory is 11.5 GB. [2018-12-09 01:14:23,871 INFO L168 Benchmark]: CodeCheck took 571971.67 ms. Allocated memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: 2.3 GB). Free memory was 823.1 MB in the beginning and 2.4 GB in the end (delta: -1.6 GB). Peak memory consumption was 643.6 MB. Max. memory is 11.5 GB. [2018-12-09 01:14:23,872 INFO L168 Benchmark]: Witness Printer took 90.49 ms. Allocated memory is still 3.4 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2018-12-09 01:14:23,873 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 198 locations, 1 error locations. UNSAFE Result, 571.8s OverallTime, 249 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: -98549604 SDtfs, 309898904 SDslu, -591273040 SDs, 0 SdLazy, 632233516 SolverSat, 1859133572 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1259.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 269259 GetRequests, 262465 SyntacticMatches, 4076 SemanticMatches, 2718 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5130356 ImplicationChecksByTransitivity, 535.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.8s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 30.5s InterpolantComputationTime, 39883 NumberOfCodeBlocks, 39883 NumberOfCodeBlocksAsserted, 249 NumberOfCheckSat, 39373 ConstructedInterpolants, 0 QuantifiedInterpolants, 27249172 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 248 InterpolantComputations, 208 PerfectInterpolantSequences, 36091/36533 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: 395]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int a= 1; [L8] int d= 4; [L9] int e= 5; [L10] int f= 6; [L11] int c= 3; [L12] int b= 2; [L15] int u = 21; [L16] int v = 22; [L17] int w = 23; [L18] int x = 24; [L19] int y = 25; [L20] int z = 26; [L22] int a17 = 1; [L23] int a7 = 0; [L24] int a20 = 1; [L25] int a8 = 15; [L26] int a12 = 8; [L27] int a16 = 5; [L28] int a21 = 1; [L580] int output = -1; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND TRUE ((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))) [L334] a17 = 0 [L335] a16 = 4 [L336] return 21; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND TRUE (((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)) [L269] a20 = 0 [L270] a17 = 1 [L271] a16 = 6 [L272] return 21; VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND TRUE (((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)) [L63] a17 = 0 [L64] return 26; VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=6, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND TRUE ((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))) [L73] a7 = 1 [L74] a17 = 1 [L75] a21 = 0 [L76] a20 = 1 [L77] a8 = 13 [L78] a16 = 5 [L79] return 26; VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=5, a17=1, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND TRUE ((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1))) [L149] a16 = 4 [L150] a17 = 0 [L151] return 25; VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=0, a20=1, a21=0, a7=1, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND TRUE ((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1))) [L232] a8 = 14 [L233] a7 = 0 [L234] a17 = 1 [L235] a21 = 1 [L236] a16 = 4 [L237] return -1; VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L591] output = calculate_output(input) [L583] COND TRUE 1 [L586] int input; [L587] input = __VERIFIER_nondet_int() [L588] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L31] COND FALSE !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L35] COND FALSE !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L43] COND FALSE !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L49] COND FALSE !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L54] COND FALSE !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L62] COND FALSE !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L65] COND FALSE !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L72] COND FALSE !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1))))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L80] COND FALSE !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L97] COND FALSE !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L102] COND FALSE !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L108] COND FALSE !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L114] COND FALSE !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L119] COND FALSE !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L124] COND FALSE !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L136] COND FALSE !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L148] COND FALSE !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L152] COND FALSE !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L160] COND FALSE !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L165] COND FALSE !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L173] COND FALSE !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L178] COND FALSE !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L186] COND FALSE !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L194] COND FALSE !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L203] COND FALSE !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8)))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L214] COND FALSE !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1)))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L218] COND FALSE !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L223] COND FALSE !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L231] COND FALSE !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L238] COND FALSE !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1)))))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L245] COND FALSE !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L250] COND FALSE !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L256] COND FALSE !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L261] COND FALSE !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L265] COND FALSE !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L268] COND FALSE !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L273] COND FALSE !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4))))))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L278] COND FALSE !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L292] COND FALSE !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L299] COND FALSE !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L306] COND FALSE !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L312] COND FALSE !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L316] COND FALSE !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L318] COND FALSE !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L329] COND FALSE !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L333] COND FALSE !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L337] COND FALSE !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L345] COND FALSE !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1))))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L353] COND FALSE !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8)))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L355] COND FALSE !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L361] COND FALSE !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L363] COND FALSE !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L365] COND FALSE !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L372] COND FALSE !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L377] COND FALSE !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L382] COND FALSE !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13)))))))) [L391] COND FALSE !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1))) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L394] COND TRUE (((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)) VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L395] __VERIFIER_error() VAL [a=1, a12=8, a16=4, a17=1, a20=1, a21=1, a7=0, a8=14, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 316.41 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 74.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -101.3 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 996.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 823.1 MB in the end (delta: 217.8 MB). Peak memory consumption was 217.8 MB. Max. memory is 11.5 GB. * CodeCheck took 571971.67 ms. Allocated memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: 2.3 GB). Free memory was 823.1 MB in the beginning and 2.4 GB in the end (delta: -1.6 GB). Peak memory consumption was 643.6 MB. Max. memory is 11.5 GB. * Witness Printer took 90.49 ms. Allocated memory is still 3.4 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...