./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/toy2_false-unreach-call_false-termination.cil.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_32f96413-ae2f-48d2-b3ea-1dad76bbd9c5/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_32f96413-ae2f-48d2-b3ea-1dad76bbd9c5/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_32f96413-ae2f-48d2-b3ea-1dad76bbd9c5/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_32f96413-ae2f-48d2-b3ea-1dad76bbd9c5/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/systemc/toy2_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_32f96413-ae2f-48d2-b3ea-1dad76bbd9c5/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_32f96413-ae2f-48d2-b3ea-1dad76bbd9c5/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 c8989412e094655bcf4508d76eb9764ed06d0b34 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-02 15:08:18,263 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 15:08:18,264 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 15:08:18,271 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 15:08:18,271 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 15:08:18,271 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 15:08:18,272 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 15:08:18,273 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 15:08:18,274 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 15:08:18,274 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 15:08:18,275 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 15:08:18,275 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 15:08:18,275 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 15:08:18,276 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 15:08:18,276 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 15:08:18,277 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 15:08:18,277 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 15:08:18,278 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 15:08:18,279 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 15:08:18,280 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 15:08:18,280 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 15:08:18,281 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 15:08:18,282 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 15:08:18,282 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 15:08:18,282 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 15:08:18,283 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 15:08:18,283 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 15:08:18,284 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 15:08:18,284 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 15:08:18,285 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 15:08:18,285 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 15:08:18,285 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 15:08:18,285 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 15:08:18,285 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 15:08:18,286 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 15:08:18,286 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 15:08:18,287 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_32f96413-ae2f-48d2-b3ea-1dad76bbd9c5/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-12-02 15:08:18,294 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 15:08:18,294 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 15:08:18,294 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 15:08:18,295 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-12-02 15:08:18,295 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 15:08:18,295 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 15:08:18,295 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 15:08:18,295 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 15:08:18,296 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 15:08:18,296 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 15:08:18,296 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 15:08:18,296 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 15:08:18,296 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 15:08:18,296 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 15:08:18,296 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 15:08:18,296 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 15:08:18,297 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 15:08:18,297 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 15:08:18,297 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-02 15:08:18,297 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-02 15:08:18,297 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 15:08:18,297 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 15:08:18,297 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-02 15:08:18,297 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 15:08:18,298 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 15:08:18,298 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 15:08:18,298 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-02 15:08:18,298 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 15:08:18,298 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 15:08:18,298 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_32f96413-ae2f-48d2-b3ea-1dad76bbd9c5/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 -> c8989412e094655bcf4508d76eb9764ed06d0b34 [2018-12-02 15:08:18,315 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 15:08:18,322 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 15:08:18,324 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 15:08:18,325 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 15:08:18,325 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 15:08:18,326 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_32f96413-ae2f-48d2-b3ea-1dad76bbd9c5/bin-2019/ukojak/../../sv-benchmarks/c/systemc/toy2_false-unreach-call_false-termination.cil.c [2018-12-02 15:08:18,361 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_32f96413-ae2f-48d2-b3ea-1dad76bbd9c5/bin-2019/ukojak/data/e742c939e/95a0512e375846cbae0b3f9c6a1d9b48/FLAG5eabd1b29 [2018-12-02 15:08:18,800 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 15:08:18,800 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_32f96413-ae2f-48d2-b3ea-1dad76bbd9c5/sv-benchmarks/c/systemc/toy2_false-unreach-call_false-termination.cil.c [2018-12-02 15:08:18,805 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_32f96413-ae2f-48d2-b3ea-1dad76bbd9c5/bin-2019/ukojak/data/e742c939e/95a0512e375846cbae0b3f9c6a1d9b48/FLAG5eabd1b29 [2018-12-02 15:08:18,813 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_32f96413-ae2f-48d2-b3ea-1dad76bbd9c5/bin-2019/ukojak/data/e742c939e/95a0512e375846cbae0b3f9c6a1d9b48 [2018-12-02 15:08:18,815 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 15:08:18,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 15:08:18,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 15:08:18,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 15:08:18,818 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 15:08:18,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:08:18" (1/1) ... [2018-12-02 15:08:18,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4040b4f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:18, skipping insertion in model container [2018-12-02 15:08:18,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:08:18" (1/1) ... [2018-12-02 15:08:18,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 15:08:18,845 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 15:08:18,957 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:08:18,961 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 15:08:18,987 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:08:19,028 INFO L195 MainTranslator]: Completed translation [2018-12-02 15:08:19,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:19 WrapperNode [2018-12-02 15:08:19,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 15:08:19,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 15:08:19,029 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 15:08:19,029 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 15:08:19,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:19" (1/1) ... [2018-12-02 15:08:19,042 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:19" (1/1) ... [2018-12-02 15:08:19,060 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 15:08:19,060 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 15:08:19,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 15:08:19,061 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 15:08:19,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:19" (1/1) ... [2018-12-02 15:08:19,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:19" (1/1) ... [2018-12-02 15:08:19,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:19" (1/1) ... [2018-12-02 15:08:19,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:19" (1/1) ... [2018-12-02 15:08:19,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:19" (1/1) ... [2018-12-02 15:08:19,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:19" (1/1) ... [2018-12-02 15:08:19,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:19" (1/1) ... [2018-12-02 15:08:19,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 15:08:19,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 15:08:19,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 15:08:19,079 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 15:08:19,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:08:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_32f96413-ae2f-48d2-b3ea-1dad76bbd9c5/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-02 15:08:19,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 15:08:19,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 15:08:19,815 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 15:08:19,815 INFO L280 CfgBuilder]: Removed 26 assue(true) statements. [2018-12-02 15:08:19,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:08:19 BoogieIcfgContainer [2018-12-02 15:08:19,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 15:08:19,816 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-02 15:08:19,816 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-02 15:08:19,826 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-02 15:08:19,827 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:08:19" (1/1) ... [2018-12-02 15:08:19,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:08:19,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:19,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 41 states and 66 transitions. [2018-12-02 15:08:19,861 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 66 transitions. [2018-12-02 15:08:19,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 15:08:19,863 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:19,977 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-02 15:08:20,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:20,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 46 states and 80 transitions. [2018-12-02 15:08:20,012 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 80 transitions. [2018-12-02 15:08:20,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 15:08:20,013 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:20,043 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-02 15:08:20,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 47 states and 83 transitions. [2018-12-02 15:08:20,092 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 83 transitions. [2018-12-02 15:08:20,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 15:08:20,094 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:20,114 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-02 15:08:20,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 47 states and 82 transitions. [2018-12-02 15:08:20,117 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 82 transitions. [2018-12-02 15:08:20,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 15:08:20,118 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:20,135 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-02 15:08:20,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:20,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 47 states and 81 transitions. [2018-12-02 15:08:20,138 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 81 transitions. [2018-12-02 15:08:20,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 15:08:20,138 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:20,152 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-02 15:08:20,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:20,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 47 states and 80 transitions. [2018-12-02 15:08:20,155 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2018-12-02 15:08:20,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 15:08:20,156 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:20,172 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-02 15:08:20,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:20,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 48 states and 80 transitions. [2018-12-02 15:08:20,224 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 80 transitions. [2018-12-02 15:08:20,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 15:08:20,225 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:20,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 15:08:20,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:20,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 50 states and 82 transitions. [2018-12-02 15:08:20,251 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 82 transitions. [2018-12-02 15:08:20,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 15:08:20,251 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:20,265 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-02 15:08:20,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 54 states and 90 transitions. [2018-12-02 15:08:20,274 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 90 transitions. [2018-12-02 15:08:20,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 15:08:20,274 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:20,328 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-02 15:08:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:20,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 61 states and 104 transitions. [2018-12-02 15:08:20,518 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 104 transitions. [2018-12-02 15:08:20,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 15:08:20,518 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:20,532 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-02 15:08:20,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:20,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 64 states and 110 transitions. [2018-12-02 15:08:20,564 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 110 transitions. [2018-12-02 15:08:20,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 15:08:20,565 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:20,580 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-02 15:08:20,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:20,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 68 states and 121 transitions. [2018-12-02 15:08:20,689 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 121 transitions. [2018-12-02 15:08:20,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 15:08:20,690 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:20,722 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-02 15:08:20,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:20,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 69 states and 123 transitions. [2018-12-02 15:08:20,775 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 123 transitions. [2018-12-02 15:08:20,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 15:08:20,776 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:20,793 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-02 15:08:20,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:20,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 70 states and 124 transitions. [2018-12-02 15:08:20,798 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 124 transitions. [2018-12-02 15:08:20,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 15:08:20,799 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:20,817 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-02 15:08:20,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:20,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 72 states and 126 transitions. [2018-12-02 15:08:20,827 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 126 transitions. [2018-12-02 15:08:20,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 15:08:20,827 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:20,844 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-02 15:08:20,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:20,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 73 states and 127 transitions. [2018-12-02 15:08:20,848 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2018-12-02 15:08:20,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 15:08:20,849 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:20,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 15:08:20,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:20,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 82 states and 139 transitions. [2018-12-02 15:08:20,879 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 139 transitions. [2018-12-02 15:08:20,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 15:08:20,880 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:20,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 15:08:20,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:20,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 83 states and 139 transitions. [2018-12-02 15:08:20,905 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 139 transitions. [2018-12-02 15:08:20,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 15:08:20,905 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:20,919 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-02 15:08:20,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:20,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 84 states and 142 transitions. [2018-12-02 15:08:20,926 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 142 transitions. [2018-12-02 15:08:20,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 15:08:20,926 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:20,935 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-02 15:08:20,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 84 states and 141 transitions. [2018-12-02 15:08:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 141 transitions. [2018-12-02 15:08:20,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 15:08:20,938 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:20,947 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-02 15:08:20,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 84 states and 140 transitions. [2018-12-02 15:08:20,949 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 140 transitions. [2018-12-02 15:08:20,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 15:08:20,950 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:20,958 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-02 15:08:20,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:20,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 84 states and 139 transitions. [2018-12-02 15:08:20,963 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 139 transitions. [2018-12-02 15:08:20,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 15:08:20,964 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:20,981 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:08:20,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:20,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 86 states and 142 transitions. [2018-12-02 15:08:20,987 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 142 transitions. [2018-12-02 15:08:20,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 15:08:20,988 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:21,000 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 15:08:21,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:21,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 87 states and 143 transitions. [2018-12-02 15:08:21,005 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 143 transitions. [2018-12-02 15:08:21,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 15:08:21,005 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:21,047 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:08:21,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:21,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 97 states and 162 transitions. [2018-12-02 15:08:21,204 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 162 transitions. [2018-12-02 15:08:21,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 15:08:21,204 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:21,237 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 15:08:21,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:21,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 106 states and 176 transitions. [2018-12-02 15:08:21,304 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 176 transitions. [2018-12-02 15:08:21,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 15:08:21,304 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:21,317 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 15:08:21,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:21,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 107 states and 176 transitions. [2018-12-02 15:08:21,349 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 176 transitions. [2018-12-02 15:08:21,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 15:08:21,349 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:21,400 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:08:21,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:21,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 118 states and 195 transitions. [2018-12-02 15:08:21,622 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 195 transitions. [2018-12-02 15:08:21,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 15:08:21,622 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:21,634 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 15:08:21,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:21,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 122 states and 200 transitions. [2018-12-02 15:08:21,649 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 200 transitions. [2018-12-02 15:08:21,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 15:08:21,650 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:21,659 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 15:08:21,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:21,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 125 states and 202 transitions. [2018-12-02 15:08:21,667 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 202 transitions. [2018-12-02 15:08:21,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 15:08:21,667 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-02 15:08:21,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:21,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 127 states and 204 transitions. [2018-12-02 15:08:21,685 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 204 transitions. [2018-12-02 15:08:21,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 15:08:21,686 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:21,696 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 15:08:21,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:21,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 131 states and 210 transitions. [2018-12-02 15:08:21,757 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 210 transitions. [2018-12-02 15:08:21,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 15:08:21,757 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:21,770 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 15:08:21,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:21,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 136 states and 219 transitions. [2018-12-02 15:08:21,934 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 219 transitions. [2018-12-02 15:08:21,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 15:08:21,935 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 15:08:22,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:22,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 140 states and 226 transitions. [2018-12-02 15:08:22,075 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 226 transitions. [2018-12-02 15:08:22,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 15:08:22,076 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:22,085 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 15:08:22,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:22,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 144 states and 236 transitions. [2018-12-02 15:08:22,312 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 236 transitions. [2018-12-02 15:08:22,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 15:08:22,312 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:22,359 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 15:08:22,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:22,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 152 states and 251 transitions. [2018-12-02 15:08:22,611 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 251 transitions. [2018-12-02 15:08:22,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 15:08:22,612 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:22,622 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 15:08:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 154 states and 253 transitions. [2018-12-02 15:08:22,685 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 253 transitions. [2018-12-02 15:08:22,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 15:08:22,686 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 15:08:22,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 154 states and 251 transitions. [2018-12-02 15:08:22,703 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 251 transitions. [2018-12-02 15:08:22,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 15:08:22,704 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:22,717 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 15:08:22,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 155 states and 251 transitions. [2018-12-02 15:08:22,722 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 251 transitions. [2018-12-02 15:08:22,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 15:08:22,723 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:22,751 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 15:08:22,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:22,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 157 states and 253 transitions. [2018-12-02 15:08:22,757 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 253 transitions. [2018-12-02 15:08:22,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 15:08:22,757 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:22,837 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 15:08:23,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:23,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 162 states and 260 transitions. [2018-12-02 15:08:23,042 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 260 transitions. [2018-12-02 15:08:23,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 15:08:23,042 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:23,051 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 15:08:23,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:23,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 167 states and 270 transitions. [2018-12-02 15:08:23,458 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 270 transitions. [2018-12-02 15:08:23,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 15:08:23,459 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:23,475 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 15:08:23,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:23,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 167 states and 268 transitions. [2018-12-02 15:08:23,482 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 268 transitions. [2018-12-02 15:08:23,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 15:08:23,483 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:23,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:23,494 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 15:08:23,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:23,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 168 states and 268 transitions. [2018-12-02 15:08:23,500 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 268 transitions. [2018-12-02 15:08:23,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 15:08:23,501 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:23,539 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-02 15:08:23,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:23,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 169 states and 268 transitions. [2018-12-02 15:08:23,545 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 268 transitions. [2018-12-02 15:08:23,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 15:08:23,545 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:23,568 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:08:23,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:23,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 172 states and 275 transitions. [2018-12-02 15:08:23,730 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 275 transitions. [2018-12-02 15:08:23,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 15:08:23,730 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:23,740 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 15:08:23,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:23,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 174 states and 276 transitions. [2018-12-02 15:08:23,842 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 276 transitions. [2018-12-02 15:08:23,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 15:08:23,842 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:23,850 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 15:08:23,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:23,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 174 states and 274 transitions. [2018-12-02 15:08:23,855 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 274 transitions. [2018-12-02 15:08:23,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 15:08:23,855 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:23,897 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 15:08:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:24,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 180 states and 286 transitions. [2018-12-02 15:08:24,515 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 286 transitions. [2018-12-02 15:08:24,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 15:08:24,515 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:24,523 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 15:08:24,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 181 states and 286 transitions. [2018-12-02 15:08:24,656 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 286 transitions. [2018-12-02 15:08:24,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 15:08:24,656 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:24,674 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:08:24,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:24,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 182 states and 283 transitions. [2018-12-02 15:08:24,739 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 283 transitions. [2018-12-02 15:08:24,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 15:08:24,739 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:24,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 15:08:25,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:25,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 188 states and 289 transitions. [2018-12-02 15:08:25,161 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 289 transitions. [2018-12-02 15:08:25,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 15:08:25,161 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:25,171 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 15:08:25,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:25,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 189 states and 290 transitions. [2018-12-02 15:08:25,312 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 290 transitions. [2018-12-02 15:08:25,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 15:08:25,312 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:25,366 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 15:08:25,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:25,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 196 states and 306 transitions. [2018-12-02 15:08:25,618 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 306 transitions. [2018-12-02 15:08:25,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 15:08:25,618 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:25,629 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 15:08:25,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 199 states and 309 transitions. [2018-12-02 15:08:25,633 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 309 transitions. [2018-12-02 15:08:25,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 15:08:25,633 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:25,641 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 15:08:25,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:25,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 201 states and 312 transitions. [2018-12-02 15:08:25,767 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 312 transitions. [2018-12-02 15:08:25,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 15:08:25,767 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:25,777 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:08:25,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:25,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 204 states and 315 transitions. [2018-12-02 15:08:25,902 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 315 transitions. [2018-12-02 15:08:25,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 15:08:25,902 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:25,913 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:08:26,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:26,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 208 states and 322 transitions. [2018-12-02 15:08:26,046 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 322 transitions. [2018-12-02 15:08:26,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 15:08:26,046 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:26,067 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 15:08:26,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:26,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 210 states and 324 transitions. [2018-12-02 15:08:26,071 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 324 transitions. [2018-12-02 15:08:26,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 15:08:26,071 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:26,082 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:08:26,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:26,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 214 states and 328 transitions. [2018-12-02 15:08:26,380 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 328 transitions. [2018-12-02 15:08:26,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 15:08:26,381 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:26,394 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:08:26,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 218 states and 332 transitions. [2018-12-02 15:08:26,779 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 332 transitions. [2018-12-02 15:08:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 15:08:26,780 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:26,850 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 15:08:27,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:27,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 224 states and 342 transitions. [2018-12-02 15:08:27,134 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 342 transitions. [2018-12-02 15:08:27,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 15:08:27,134 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:27,146 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:08:27,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 229 states and 349 transitions. [2018-12-02 15:08:27,567 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 349 transitions. [2018-12-02 15:08:27,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 15:08:27,567 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:27,577 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 15:08:27,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:27,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 233 states and 353 transitions. [2018-12-02 15:08:27,877 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 353 transitions. [2018-12-02 15:08:27,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 15:08:27,878 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:28,316 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:08:30,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:30,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 262 states and 412 transitions. [2018-12-02 15:08:30,843 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 412 transitions. [2018-12-02 15:08:30,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 15:08:30,843 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:30,867 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 15:08:30,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:30,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 262 states and 409 transitions. [2018-12-02 15:08:30,948 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 409 transitions. [2018-12-02 15:08:30,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 15:08:30,948 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:30,959 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-02 15:08:31,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:31,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 268 states and 415 transitions. [2018-12-02 15:08:31,444 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 415 transitions. [2018-12-02 15:08:31,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 15:08:31,445 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 15:08:31,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:31,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 272 states and 426 transitions. [2018-12-02 15:08:31,766 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 426 transitions. [2018-12-02 15:08:31,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 15:08:31,766 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:31,777 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 15:08:31,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:31,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 274 states and 427 transitions. [2018-12-02 15:08:31,783 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 427 transitions. [2018-12-02 15:08:31,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 15:08:31,783 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:31,794 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 15:08:31,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:31,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 275 states and 428 transitions. [2018-12-02 15:08:31,804 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 428 transitions. [2018-12-02 15:08:31,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 15:08:31,804 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:31,815 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 15:08:31,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:31,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 279 states and 433 transitions. [2018-12-02 15:08:31,836 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 433 transitions. [2018-12-02 15:08:31,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 15:08:31,837 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:32,963 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 17 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:08:36,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:36,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 293 states and 470 transitions. [2018-12-02 15:08:36,998 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 470 transitions. [2018-12-02 15:08:36,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 15:08:36,999 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:37,979 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:08:41,757 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2018-12-02 15:08:42,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 302 states and 500 transitions. [2018-12-02 15:08:42,504 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 500 transitions. [2018-12-02 15:08:42,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 15:08:42,505 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:42,520 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 15:08:43,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:43,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 306 states and 510 transitions. [2018-12-02 15:08:43,652 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 510 transitions. [2018-12-02 15:08:43,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 15:08:43,653 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:45,972 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:08:49,485 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2018-12-02 15:08:49,736 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2018-12-02 15:08:51,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:51,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 318 states and 547 transitions. [2018-12-02 15:08:51,054 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 547 transitions. [2018-12-02 15:08:51,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 15:08:51,054 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:51,091 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 26 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 15:08:51,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 320 states and 548 transitions. [2018-12-02 15:08:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 548 transitions. [2018-12-02 15:08:51,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 15:08:51,114 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:52,377 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:08:54,480 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2018-12-02 15:08:55,938 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-12-02 15:08:57,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:08:57,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 329 states and 570 transitions. [2018-12-02 15:08:57,417 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 570 transitions. [2018-12-02 15:08:57,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 15:08:57,417 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:08:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:08:58,182 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 29 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:09:02,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:09:02,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 356 states and 630 transitions. [2018-12-02 15:09:02,855 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 630 transitions. [2018-12-02 15:09:02,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 15:09:02,856 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:09:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:09:02,869 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 28 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 15:09:02,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:09:02,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 357 states and 631 transitions. [2018-12-02 15:09:02,877 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 631 transitions. [2018-12-02 15:09:02,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 15:09:02,877 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:09:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:09:04,332 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 21 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:09:06,522 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2018-12-02 15:09:07,411 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2018-12-02 15:09:09,109 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2018-12-02 15:09:10,083 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2018-12-02 15:09:12,962 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2018-12-02 15:09:13,345 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2018-12-02 15:09:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:09:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 371 states and 677 transitions. [2018-12-02 15:09:14,082 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 677 transitions. [2018-12-02 15:09:14,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 15:09:14,082 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:09:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:09:14,320 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 21 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:09:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:09:15,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 375 states and 687 transitions. [2018-12-02 15:09:15,489 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 687 transitions. [2018-12-02 15:09:15,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 15:09:15,489 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:09:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:09:16,980 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:09:23,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:09:23,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 386 states and 720 transitions. [2018-12-02 15:09:23,041 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 720 transitions. [2018-12-02 15:09:23,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 15:09:23,041 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:09:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:09:26,924 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 19 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:09:34,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:09:34,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 402 states and 771 transitions. [2018-12-02 15:09:34,809 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 771 transitions. [2018-12-02 15:09:34,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 15:09:34,809 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:09:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:09:35,473 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 19 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:09:36,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:09:36,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 403 states and 776 transitions. [2018-12-02 15:09:36,338 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 776 transitions. [2018-12-02 15:09:36,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 15:09:36,338 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:09:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:09:36,352 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-02 15:09:36,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:09:36,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 405 states and 780 transitions. [2018-12-02 15:09:36,674 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 780 transitions. [2018-12-02 15:09:36,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 15:09:36,674 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:09:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:09:36,682 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-02 15:09:37,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:09:37,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 408 states and 784 transitions. [2018-12-02 15:09:37,745 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 784 transitions. [2018-12-02 15:09:37,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 15:09:37,745 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:09:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:09:37,759 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-02 15:09:37,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:09:37,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 410 states and 787 transitions. [2018-12-02 15:09:37,998 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 787 transitions. [2018-12-02 15:09:37,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-02 15:09:37,999 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:09:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:09:38,250 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-02 15:09:38,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:09:38,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 401 states and 763 transitions. [2018-12-02 15:09:38,430 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 763 transitions. [2018-12-02 15:09:38,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 15:09:38,431 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:09:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:09:42,736 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 20 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:09:48,055 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2018-12-02 15:09:54,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:09:54,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 414 states and 810 transitions. [2018-12-02 15:09:54,397 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 810 transitions. [2018-12-02 15:09:54,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 15:09:54,397 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:09:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:09:54,787 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 20 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:09:57,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:09:57,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 421 states and 831 transitions. [2018-12-02 15:09:57,652 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 831 transitions. [2018-12-02 15:09:57,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 15:09:57,653 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:09:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:10:02,955 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 19 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:10:06,525 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2018-12-02 15:10:07,357 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2018-12-02 15:10:09,430 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2018-12-02 15:10:11,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:10:11,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 432 states and 860 transitions. [2018-12-02 15:10:11,238 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 860 transitions. [2018-12-02 15:10:11,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 15:10:11,239 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:10:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:10:11,938 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 19 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:10:12,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:10:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 433 states and 860 transitions. [2018-12-02 15:10:12,656 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 860 transitions. [2018-12-02 15:10:12,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 15:10:12,656 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:10:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:10:13,360 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 19 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:10:15,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:10:15,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 437 states and 872 transitions. [2018-12-02 15:10:15,574 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 872 transitions. [2018-12-02 15:10:15,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 15:10:15,575 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:10:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:10:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 19 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:10:18,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:10:18,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 438 states and 875 transitions. [2018-12-02 15:10:18,328 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 875 transitions. [2018-12-02 15:10:18,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 15:10:18,329 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:10:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:10:19,037 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 19 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:10:19,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:10:19,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 439 states and 882 transitions. [2018-12-02 15:10:19,712 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 882 transitions. [2018-12-02 15:10:19,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 15:10:19,713 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:10:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:10:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 15:10:20,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:10:20,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 440 states and 892 transitions. [2018-12-02 15:10:20,316 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 892 transitions. [2018-12-02 15:10:20,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 15:10:20,316 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:10:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:10:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-02 15:10:21,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:10:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 443 states and 897 transitions. [2018-12-02 15:10:21,033 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 897 transitions. [2018-12-02 15:10:21,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 15:10:21,033 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:10:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:10:21,040 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-02 15:10:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:10:21,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 445 states and 900 transitions. [2018-12-02 15:10:21,266 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 900 transitions. [2018-12-02 15:10:21,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 15:10:21,266 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:10:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:10:21,289 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 15:10:21,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:10:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 445 states and 896 transitions. [2018-12-02 15:10:21,498 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 896 transitions. [2018-12-02 15:10:21,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 15:10:21,499 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:10:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:10:23,262 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 19 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:10:25,077 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2018-12-02 15:10:27,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:10:27,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 450 states and 902 transitions. [2018-12-02 15:10:27,214 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 902 transitions. [2018-12-02 15:10:27,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 15:10:27,215 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:10:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:10:32,800 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 19 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:10:37,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:10:37,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 453 states and 910 transitions. [2018-12-02 15:10:37,539 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 910 transitions. [2018-12-02 15:10:37,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 15:10:37,539 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:10:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:10:38,070 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 19 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:10:38,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:10:38,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 454 states and 916 transitions. [2018-12-02 15:10:38,762 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 916 transitions. [2018-12-02 15:10:38,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 15:10:38,763 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:10:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:10:39,432 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 19 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:10:40,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:10:40,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 455 states and 919 transitions. [2018-12-02 15:10:40,180 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 919 transitions. [2018-12-02 15:10:40,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 15:10:40,181 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:10:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:10:40,721 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 41 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 15:10:40,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:10:40,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 457 states and 920 transitions. [2018-12-02 15:10:40,743 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 920 transitions. [2018-12-02 15:10:40,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 15:10:40,744 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:10:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:10:41,316 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 38 proven. 19 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 15:10:41,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:10:41,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 458 states and 920 transitions. [2018-12-02 15:10:41,338 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 920 transitions. [2018-12-02 15:10:41,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 15:10:41,338 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:10:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:10:45,732 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 19 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:10:50,192 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-12-02 15:10:57,636 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2018-12-02 15:10:59,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:10:59,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 468 states and 959 transitions. [2018-12-02 15:10:59,310 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 959 transitions. [2018-12-02 15:10:59,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 15:10:59,311 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:10:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:10:59,359 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 19 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:11:01,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:11:01,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 473 states and 975 transitions. [2018-12-02 15:11:01,761 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 975 transitions. [2018-12-02 15:11:01,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 15:11:01,761 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:11:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:11:01,773 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 15:11:02,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:11:02,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 473 states and 974 transitions. [2018-12-02 15:11:02,002 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 974 transitions. [2018-12-02 15:11:02,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 15:11:02,003 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:11:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:11:05,185 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2018-12-02 15:11:06,533 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2018-12-02 15:11:07,600 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 35 [2018-12-02 15:11:09,716 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2018-12-02 15:11:10,314 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 25 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:11:19,150 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2018-12-02 15:11:19,574 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2018-12-02 15:11:23,437 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2018-12-02 15:11:25,211 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-12-02 15:11:25,551 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2018-12-02 15:11:27,188 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2018-12-02 15:11:27,542 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2018-12-02 15:11:28,568 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-12-02 15:11:35,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:11:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 498 states and 1051 transitions. [2018-12-02 15:11:35,357 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 1051 transitions. [2018-12-02 15:11:35,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 15:11:35,357 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:11:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:11:35,443 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 25 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:11:38,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:11:38,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 506 states and 1069 transitions. [2018-12-02 15:11:38,333 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 1069 transitions. [2018-12-02 15:11:38,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 15:11:38,333 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:11:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:11:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 23 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:11:55,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:11:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 518 states and 1127 transitions. [2018-12-02 15:11:55,660 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 1127 transitions. [2018-12-02 15:11:55,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 15:11:55,661 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:11:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:11:55,905 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 23 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:11:57,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:11:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 519 states and 1139 transitions. [2018-12-02 15:11:57,363 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 1139 transitions. [2018-12-02 15:11:57,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 15:11:57,364 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:11:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:12:00,468 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 22 proven. 67 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 15:12:03,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:12:03,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 522 states and 1157 transitions. [2018-12-02 15:12:03,100 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1157 transitions. [2018-12-02 15:12:03,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 15:12:03,100 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:12:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:12:04,112 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 22 proven. 67 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 15:12:04,788 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2018-12-02 15:12:06,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:12:06,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 526 states and 1179 transitions. [2018-12-02 15:12:06,875 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 1179 transitions. [2018-12-02 15:12:06,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 15:12:06,875 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:12:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:12:07,947 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 22 proven. 67 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 15:12:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:12:09,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 527 states and 1181 transitions. [2018-12-02 15:12:09,109 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 1181 transitions. [2018-12-02 15:12:09,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 15:12:09,109 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:12:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:12:09,120 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-02 15:12:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:12:10,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 530 states and 1187 transitions. [2018-12-02 15:12:10,297 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1187 transitions. [2018-12-02 15:12:10,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 15:12:10,298 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:12:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:12:10,306 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-02 15:12:10,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:12:10,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 533 states and 1191 transitions. [2018-12-02 15:12:10,968 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 1191 transitions. [2018-12-02 15:12:10,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 15:12:10,969 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:12:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:12:11,018 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-02 15:12:11,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:12:11,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 536 states and 1195 transitions. [2018-12-02 15:12:11,983 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1195 transitions. [2018-12-02 15:12:11,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 15:12:11,984 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:12:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:12:12,025 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-02 15:12:13,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:12:13,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 540 states and 1201 transitions. [2018-12-02 15:12:13,723 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 1201 transitions. [2018-12-02 15:12:13,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 15:12:13,723 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:12:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:12:13,771 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-02 15:12:15,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:12:15,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 543 states and 1204 transitions. [2018-12-02 15:12:15,227 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 1204 transitions. [2018-12-02 15:12:15,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 15:12:15,228 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:12:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:12:15,280 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-02 15:12:15,714 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2018-12-02 15:12:17,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:12:17,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 544 states and 1205 transitions. [2018-12-02 15:12:17,454 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1205 transitions. [2018-12-02 15:12:17,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 15:12:17,455 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:12:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:12:17,522 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 15:12:18,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:12:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 546 states and 1207 transitions. [2018-12-02 15:12:18,693 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1207 transitions. [2018-12-02 15:12:18,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 15:12:18,694 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:12:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:12:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 15:12:26,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:12:26,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 560 states and 1233 transitions. [2018-12-02 15:12:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 1233 transitions. [2018-12-02 15:12:26,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 15:12:26,605 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:12:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:12:26,613 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-02 15:12:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:12:27,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 560 states and 1228 transitions. [2018-12-02 15:12:27,448 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 1228 transitions. [2018-12-02 15:12:27,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 15:12:27,449 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:12:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:12:33,153 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 24 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:12:46,686 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-12-02 15:12:48,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:12:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 566 states and 1246 transitions. [2018-12-02 15:12:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 1246 transitions. [2018-12-02 15:12:48,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 15:12:48,760 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:12:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:12:55,058 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 22 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:13:07,741 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2018-12-02 15:13:08,147 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2018-12-02 15:13:13,080 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2018-12-02 15:13:14,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:13:14,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 576 states and 1281 transitions. [2018-12-02 15:13:14,843 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1281 transitions. [2018-12-02 15:13:14,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 15:13:14,843 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:13:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:13:14,915 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 22 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:13:16,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:13:16,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 577 states and 1287 transitions. [2018-12-02 15:13:16,641 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 1287 transitions. [2018-12-02 15:13:16,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 15:13:16,642 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:13:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:13:16,693 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 15:13:21,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:13:21,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 578 states and 1294 transitions. [2018-12-02 15:13:21,066 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 1294 transitions. [2018-12-02 15:13:21,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 15:13:21,067 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:13:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:13:21,116 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 32 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 15:13:22,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:13:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 580 states and 1295 transitions. [2018-12-02 15:13:22,786 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1295 transitions. [2018-12-02 15:13:22,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 15:13:22,787 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:13:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:13:23,548 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 45 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 15:13:27,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:13:27,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 583 states and 1300 transitions. [2018-12-02 15:13:27,638 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 1300 transitions. [2018-12-02 15:13:27,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 15:13:27,639 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:13:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:13:27,661 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-02 15:13:28,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:13:28,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 584 states and 1300 transitions. [2018-12-02 15:13:28,066 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1300 transitions. [2018-12-02 15:13:28,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 15:13:28,066 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:13:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:13:28,114 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 32 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 15:13:31,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:13:31,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 589 states and 1304 transitions. [2018-12-02 15:13:31,237 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 1304 transitions. [2018-12-02 15:13:31,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 15:13:31,238 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:13:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:13:35,772 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 47 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 15:13:58,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:13:58,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 616 states and 1354 transitions. [2018-12-02 15:13:58,993 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 1354 transitions. [2018-12-02 15:13:58,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 15:13:58,993 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:13:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:14:01,665 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-02 15:14:07,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:14:07,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 626 states and 1376 transitions. [2018-12-02 15:14:07,546 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 1376 transitions. [2018-12-02 15:14:07,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 15:14:07,547 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:14:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:14:13,437 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 28 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:14:15,180 WARN L180 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-12-02 15:14:15,629 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2018-12-02 15:14:18,566 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-12-02 15:14:19,000 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2018-12-02 15:14:20,613 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2018-12-02 15:14:28,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:14:28,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 635 states and 1401 transitions. [2018-12-02 15:14:28,928 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1401 transitions. [2018-12-02 15:14:28,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 15:14:28,928 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:14:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:14:30,707 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 33 [2018-12-02 15:14:32,858 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 46 [2018-12-02 15:14:33,629 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2018-12-02 15:14:36,105 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 26 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:14:41,469 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2018-12-02 15:14:45,542 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2018-12-02 15:14:54,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:14:54,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 648 states and 1433 transitions. [2018-12-02 15:14:54,026 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1433 transitions. [2018-12-02 15:14:54,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 15:14:54,026 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:14:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:14:59,731 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2018-12-02 15:15:02,241 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 25 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:15:14,236 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2018-12-02 15:15:14,759 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2018-12-02 15:15:20,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:15:20,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 657 states and 1463 transitions. [2018-12-02 15:15:20,748 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1463 transitions. [2018-12-02 15:15:20,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 15:15:20,749 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:15:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:15:21,950 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 25 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:15:22,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:15:22,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 658 states and 1466 transitions. [2018-12-02 15:15:22,957 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1466 transitions. [2018-12-02 15:15:22,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 15:15:22,957 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:15:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:15:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 25 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:15:25,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:15:25,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 659 states and 1474 transitions. [2018-12-02 15:15:25,042 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1474 transitions. [2018-12-02 15:15:25,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-02 15:15:25,043 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:15:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:15:25,747 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 25 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:15:28,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:15:28,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 660 states and 1479 transitions. [2018-12-02 15:15:28,186 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1479 transitions. [2018-12-02 15:15:28,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 15:15:28,187 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:15:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:15:28,238 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-02 15:15:29,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:15:29,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 660 states and 1474 transitions. [2018-12-02 15:15:29,892 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1474 transitions. [2018-12-02 15:15:29,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 15:15:29,893 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:15:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:15:29,940 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 55 proven. 24 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-02 15:15:29,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-02 15:15:29,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 661 states and 1476 transitions. [2018-12-02 15:15:29,980 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1476 transitions. [2018-12-02 15:15:29,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 15:15:29,981 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-02 15:15:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:15:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:15:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:15:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:15:30,144 WARN L497 CodeCheckObserver]: This program is UNSAFE, Check terminated with 142 iterations. [2018-12-02 15:15:30,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 03:15:30 ImpRootNode [2018-12-02 15:15:30,229 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-02 15:15:30,229 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 15:15:30,229 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 15:15:30,230 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 15:15:30,230 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:08:19" (3/4) ... [2018-12-02 15:15:30,231 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 15:15:30,323 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_32f96413-ae2f-48d2-b3ea-1dad76bbd9c5/bin-2019/ukojak/witness.graphml [2018-12-02 15:15:30,323 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 15:15:30,323 INFO L168 Benchmark]: Toolchain (without parser) took 431508.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 959.7 MB in the beginning and 637.4 MB in the end (delta: 322.3 MB). Peak memory consumption was 424.6 MB. Max. memory is 11.5 GB. [2018-12-02 15:15:30,324 INFO L168 Benchmark]: CDTParser took 0.10 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-02 15:15:30,324 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 959.7 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2018-12-02 15:15:30,324 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-02 15:15:30,324 INFO L168 Benchmark]: Boogie Preprocessor took 18.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-02 15:15:30,324 INFO L168 Benchmark]: RCFGBuilder took 736.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 965.3 MB in the end (delta: 155.3 MB). Peak memory consumption was 155.3 MB. Max. memory is 11.5 GB. [2018-12-02 15:15:30,324 INFO L168 Benchmark]: CodeCheck took 430412.92 ms. Allocated memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: -27.3 MB). Free memory was 965.3 MB in the beginning and 655.8 MB in the end (delta: 309.5 MB). Peak memory consumption was 282.2 MB. Max. memory is 11.5 GB. [2018-12-02 15:15:30,325 INFO L168 Benchmark]: Witness Printer took 93.39 ms. Allocated memory is still 1.1 GB. Free memory was 655.8 MB in the beginning and 637.4 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-02 15:15:30,326 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, 125 locations, 1 error locations. UNSAFE Result, 430.3s OverallTime, 142 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 0 SDtfs, -1220912226 SDslu, -1876463368 SDs, 0 SdLazy, -1314579714 SolverSat, -1662003008 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 189.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74135 GetRequests, 70773 SyntacticMatches, 1712 SemanticMatches, 1650 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1883298 ImplicationChecksByTransitivity, 419.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 105.3s InterpolantComputationTime, 6997 NumberOfCodeBlocks, 6997 NumberOfCodeBlocksAsserted, 142 NumberOfCheckSat, 6784 ConstructedInterpolants, 0 QuantifiedInterpolants, 3736320 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 141 InterpolantComputations, 87 PerfectInterpolantSequences, 3677/6144 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: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L18] int c ; [L19] int c_t ; [L20] int c_req_up ; [L21] int p_in ; [L22] int p_out ; [L23] int wl_st ; [L24] int c1_st ; [L25] int c2_st ; [L26] int wb_st ; [L27] int r_st ; [L28] int wl_i ; [L29] int c1_i ; [L30] int c2_i ; [L31] int wb_i ; [L32] int r_i ; [L33] int wl_pc ; [L34] int c1_pc ; [L35] int c2_pc ; [L36] int wb_pc ; [L37] int e_e ; [L38] int e_f ; [L39] int e_g ; [L40] int e_c ; [L41] int e_p_in ; [L42] int e_wl ; [L48] int d ; [L49] int data ; [L50] int processed ; [L51] static int t_b ; [L679] int __retres1 ; [L683] e_wl = 2 [L684] e_c = e_wl [L685] e_g = e_c [L686] e_f = e_g [L687] e_e = e_f [L688] wl_pc = 0 [L689] c1_pc = 0 [L690] c2_pc = 0 [L691] wb_pc = 0 [L692] wb_i = 1 [L693] c2_i = wb_i [L694] c1_i = c2_i [L695] wl_i = c1_i [L696] r_i = 0 [L697] c_req_up = 0 [L698] d = 0 [L699] c = 0 [L390] int kernel_st ; [L393] kernel_st = 0 [L394] COND FALSE !((int )c_req_up == 1) [L405] COND TRUE (int )wl_i == 1 [L406] wl_st = 0 [L410] COND TRUE (int )c1_i == 1 [L411] c1_st = 0 [L415] COND TRUE (int )c2_i == 1 [L416] c2_st = 0 [L420] COND TRUE (int )wb_i == 1 [L421] wb_st = 0 [L425] COND FALSE !((int )r_i == 1) [L428] r_st = 2 [L430] COND FALSE !((int )e_f == 0) [L435] COND FALSE !((int )e_g == 0) [L440] COND FALSE !((int )e_e == 0) [L445] COND FALSE !((int )e_c == 0) [L450] COND FALSE !((int )e_wl == 0) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L455] COND FALSE !((int )wl_pc == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L463] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L473] COND FALSE !((int )c1_pc == 1) [L482] COND FALSE !((int )c2_pc == 1) [L491] COND FALSE !((int )wb_pc == 1) [L500] COND FALSE !((int )e_c == 1) [L505] COND FALSE !((int )e_e == 1) [L510] COND FALSE !((int )e_f == 1) [L515] COND FALSE !((int )e_g == 1) [L520] COND FALSE !((int )e_c == 1) [L525] COND FALSE !((int )e_wl == 1) VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L531] COND TRUE 1 [L534] kernel_st = 1 [L276] int tmp ; [L277] int tmp___0 ; [L278] int tmp___1 ; [L279] int tmp___2 ; [L280] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L284] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L286] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L307] COND TRUE (int )wl_st == 0 [L309] tmp = __VERIFIER_nondet_int() [L311] COND TRUE \read(tmp) [L313] wl_st = 1 [L53] int t ; VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L56] COND TRUE (int )wl_pc == 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L70] wl_st = 2 [L71] wl_pc = 1 [L72] e_wl = 0 VAL [c=0, c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L322] COND TRUE (int )c1_st == 0 [L324] tmp___0 = __VERIFIER_nondet_int() [L326] COND TRUE \read(tmp___0) [L328] c1_st = 1 [L127] COND TRUE (int )c1_pc == 0 [L138] COND TRUE 1 [L140] c1_st = 2 [L141] c1_pc = 1 [L337] COND TRUE (int )c2_st == 0 [L339] tmp___1 = __VERIFIER_nondet_int() [L341] COND TRUE \read(tmp___1) [L343] c2_st = 1 [L172] COND TRUE (int )c2_pc == 0 [L183] COND TRUE 1 [L185] c2_st = 2 [L186] c2_pc = 1 [L352] COND TRUE (int )wb_st == 0 [L354] tmp___2 = __VERIFIER_nondet_int() [L356] COND TRUE \read(tmp___2) [L358] wb_st = 1 [L217] COND TRUE (int )wb_pc == 0 [L228] COND TRUE 1 [L230] wb_st = 2 [L231] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L367] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L284] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L286] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L289] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L292] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L295] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L298] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L537] kernel_st = 2 [L538] COND FALSE !((int )c_req_up == 1) [L549] kernel_st = 3 [L550] COND FALSE !((int )e_f == 0) [L555] COND FALSE !((int )e_g == 0) [L560] COND FALSE !((int )e_e == 0) [L565] COND FALSE !((int )e_c == 0) [L570] COND TRUE (int )e_wl == 0 [L571] e_wl = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L575] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L576] COND TRUE (int )e_wl == 1 [L577] wl_st = 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L593] COND TRUE (int )c1_pc == 1 [L594] COND FALSE !((int )e_f == 1) [L602] COND TRUE (int )c2_pc == 1 [L603] COND FALSE !((int )e_f == 1) [L611] COND TRUE (int )wb_pc == 1 [L612] COND FALSE !((int )e_g == 1) [L620] COND FALSE !((int )e_c == 1) [L625] COND FALSE !((int )e_e == 1) [L630] COND FALSE !((int )e_f == 1) [L635] COND FALSE !((int )e_g == 1) [L640] COND FALSE !((int )e_c == 1) [L645] COND TRUE (int )e_wl == 1 [L646] e_wl = 2 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L650] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L531] COND TRUE 1 [L534] kernel_st = 1 [L276] int tmp ; [L277] int tmp___0 ; [L278] int tmp___1 ; [L279] int tmp___2 ; [L280] int tmp___3 ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L284] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L286] COND TRUE (int )wl_st == 0 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L307] COND TRUE (int )wl_st == 0 [L309] tmp = __VERIFIER_nondet_int() [L311] COND TRUE \read(tmp) [L313] wl_st = 1 [L53] int t ; VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L56] COND FALSE !((int )wl_pc == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L59] COND FALSE !((int )wl_pc == 2) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L62] COND TRUE (int )wl_pc == 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L77] COND TRUE 1 [L79] t = d [L80] data = d [L81] processed = 0 [L82] e_f = 1 [L83] COND TRUE (int )c1_pc == 1 [L84] COND TRUE (int )e_f == 1 [L85] c1_st = 0 [L92] COND TRUE (int )c2_pc == 1 [L93] COND TRUE (int )e_f == 1 [L94] c2_st = 0 [L101] e_f = 2 [L102] wl_st = 2 [L103] wl_pc = 2 [L104] t_b = t VAL [c=0, c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L322] COND TRUE (int )c1_st == 0 [L324] tmp___0 = __VERIFIER_nondet_int() [L326] COND TRUE \read(tmp___0) [L328] c1_st = 1 [L127] COND FALSE !((int )c1_pc == 0) [L130] COND TRUE (int )c1_pc == 1 [L145] COND TRUE ! processed [L146] data += 1 [L147] e_g = 1 [L148] COND TRUE (int )wb_pc == 1 [L149] COND TRUE (int )e_g == 1 [L150] wb_st = 0 [L157] e_g = 2 [L138] COND TRUE 1 [L140] c1_st = 2 [L141] c1_pc = 1 [L337] COND TRUE (int )c2_st == 0 [L339] tmp___1 = __VERIFIER_nondet_int() [L341] COND TRUE \read(tmp___1) [L343] c2_st = 1 [L172] COND FALSE !((int )c2_pc == 0) [L175] COND TRUE (int )c2_pc == 1 [L190] COND TRUE ! processed [L191] data += 1 [L192] e_g = 1 [L193] COND TRUE (int )wb_pc == 1 [L194] COND TRUE (int )e_g == 1 [L195] wb_st = 0 [L202] e_g = 2 [L183] COND TRUE 1 [L185] c2_st = 2 [L186] c2_pc = 1 [L352] COND TRUE (int )wb_st == 0 [L354] tmp___2 = __VERIFIER_nondet_int() [L356] COND TRUE \read(tmp___2) [L358] wb_st = 1 [L217] COND FALSE !((int )wb_pc == 0) [L220] COND TRUE (int )wb_pc == 1 [L235] c_t = data [L236] c_req_up = 1 [L237] processed = 1 [L228] COND TRUE 1 [L230] wb_st = 2 [L231] wb_pc = 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L367] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L284] COND TRUE 1 VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L286] COND FALSE !((int )wl_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L289] COND FALSE !((int )c1_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L292] COND FALSE !((int )c2_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L295] COND FALSE !((int )wb_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L298] COND FALSE !((int )r_st == 0) VAL [c=0, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L537] kernel_st = 2 [L538] COND TRUE (int )c_req_up == 1 [L539] COND TRUE c != c_t [L540] c = c_t [L541] e_c = 0 [L545] c_req_up = 0 [L549] kernel_st = 3 [L550] COND FALSE !((int )e_f == 0) [L555] COND FALSE !((int )e_g == 0) [L560] COND FALSE !((int )e_e == 0) [L565] COND TRUE (int )e_c == 0 [L566] e_c = 1 [L570] COND FALSE !((int )e_wl == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L575] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L583] COND TRUE (int )wl_pc == 2 [L584] COND FALSE !((int )e_e == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L593] COND TRUE (int )c1_pc == 1 [L594] COND FALSE !((int )e_f == 1) [L602] COND TRUE (int )c2_pc == 1 [L603] COND FALSE !((int )e_f == 1) [L611] COND TRUE (int )wb_pc == 1 [L612] COND FALSE !((int )e_g == 1) [L620] COND TRUE (int )e_c == 1 [L621] r_st = 0 [L625] COND FALSE !((int )e_e == 1) [L630] COND FALSE !((int )e_f == 1) [L635] COND FALSE !((int )e_g == 1) [L640] COND TRUE (int )e_c == 1 [L641] e_c = 2 [L645] COND FALSE !((int )e_wl == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L650] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L653] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L656] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L659] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L662] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L531] COND TRUE 1 [L534] kernel_st = 1 [L276] int tmp ; [L277] int tmp___0 ; [L278] int tmp___1 ; [L279] int tmp___2 ; [L280] int tmp___3 ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L284] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L286] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L289] COND FALSE !((int )c1_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L292] COND FALSE !((int )c2_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L295] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L298] COND TRUE (int )r_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L307] COND FALSE !((int )wl_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L322] COND FALSE !((int )c1_st == 0) [L337] COND FALSE !((int )c2_st == 0) [L352] COND FALSE !((int )wb_st == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L367] COND TRUE (int )r_st == 0 [L369] tmp___3 = __VERIFIER_nondet_int() [L371] COND TRUE \read(tmp___3) [L373] r_st = 1 [L249] d = c [L250] e_e = 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L251] COND FALSE !((int )wl_pc == 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L259] COND TRUE (int )wl_pc == 2 [L260] COND TRUE (int )e_e == 1 [L261] wl_st = 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L269] e_e = 2 [L270] r_st = 2 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L284] COND TRUE 1 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L286] COND TRUE (int )wl_st == 0 VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L307] COND TRUE (int )wl_st == 0 [L309] tmp = __VERIFIER_nondet_int() [L311] COND TRUE \read(tmp) [L313] wl_st = 1 [L53] int t ; VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L56] COND FALSE !((int )wl_pc == 0) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L59] COND TRUE (int )wl_pc == 2 [L108] t = t_b VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L109] COND FALSE !(d == t + 1) VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L13] __VERIFIER_error() VAL [c=2, c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 212.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 959.7 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 736.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 965.3 MB in the end (delta: 155.3 MB). Peak memory consumption was 155.3 MB. Max. memory is 11.5 GB. * CodeCheck took 430412.92 ms. Allocated memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: -27.3 MB). Free memory was 965.3 MB in the beginning and 655.8 MB in the end (delta: 309.5 MB). Peak memory consumption was 282.2 MB. Max. memory is 11.5 GB. * Witness Printer took 93.39 ms. Allocated memory is still 1.1 GB. Free memory was 655.8 MB in the beginning and 637.4 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...